in Theory of Computation
388 views
1 vote
1 vote

Pls draw the corresponding NFA/DFA for the given Grammar which are regular here .

in Theory of Computation
388 views

1 Answer

3 votes
3 votes
Best answer

Here it is important to identify the language. 

As

I) is generating $(a+b)^*$ 

II) is generating $a(a+b)^*$ 

III) is generating $a^mb^n, \; m\geq n$. 

selected by