Latest

6/recent/ticker-posts

Find an nfa that accepts the language L (aa* (a + b))- solution of Peter Linz

 Find an nfa that accepts the language L (aa* (a + b)).

(an-introduction-to-formal-languages-and-automata- Peter Linz, question no: 17, section: 3.1)

Solution:



Feel free to discuss in the comment section if you have any doubt.

Post a Comment

0 Comments