1 votes 1 votes Find an nfa without $λ$-transitions and with a single final state that accepts the set {$a$} $∪$ {$b^n : n ≥1$}. Theory of Computation peter-linz peter-linz-edition4 theory-of-computation finite-automata + – Naveen Kumar 3 asked Mar 30, 2019 Naveen Kumar 3 1.8k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 5 votes 5 votes we can make a nfa with single final state abhishekmehta4u answered Mar 30, 2019 • selected Mar 31, 2019 by srestha abhishekmehta4u comment Share Follow See all 0 reply Please log in or register to add a comment.
