1 votes 1 votes Construct an nfa with three states that accepts the language {$ab,abc$}*. Theory of Computation peter-linz peter-linz-edition4 theory-of-computation finite-automata + – Naveen Kumar 3 asked Mar 22, 2019 Naveen Kumar 3 474 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
2 votes 2 votes we can construct NFA with 3 state abhishekmehta4u answered Mar 24, 2019 abhishekmehta4u comment Share Follow See all 0 reply Please log in or register to add a comment.