516 views

1 Answer

Best answer
0 votes
0 votes

becz in case of   L1 = {anbn| n>=0 } we need to do infinite number of comparision which is not the job of automata.

but in case of  L2 = {an|n>=0} it is just like any number of a so we can design dfa for it....hence regular

selected by

Related questions

0 votes
0 votes
1 answer
2
M_Umair_Khan42900 asked Dec 29, 2022
754 views
Show that the following pairs of regular expressions define the same language over the alphabet I = [a, b].s(a) p(pp)*( A + p)q + q and p*q(b) A +0(0+1)* + (0+1)* 00(0+1)...
0 votes
0 votes
1 answer
3
0 votes
0 votes
2 answers
4