445 views

1 Answer

Related questions

0 votes
0 votes
1 answer
1
M_Umair_Khan42900 asked Dec 29, 2022
743 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
2 answers
2
0 votes
0 votes
1 answer
3
Mk Utkarsh asked Nov 23, 2017
515 views
if L1 = {anbn| n>=0} is not regular then how come L2 = {an|n>=0} is regular?
3 votes
3 votes
1 answer
4
logan1x asked May 10, 2019
1,096 views
Why is ambiguity in regular language is decidable and not decidable in CFL ? Can you give Example?