3,142 views

1 Answer

Best answer
0 votes
0 votes
smallest string generated by this grammer =

S=>abB

s=>abbbAa

there is two option A->aaBb  or epsilen

put epsilen then smallest string =>abbba

next but A=aaBb

s=>abbbaaBba

again put B=bbAa

​​​​​​​s=>abbbaabbAaba​​​​​​​

there is two option A->aaBb  or epsilen

put epsilen then next string =>ab(bbaa)(bba)(ba)​​​​​​​

put A=aaBb

abbbaabbaaBbaba

put value of B​​​​​​​

abbbaabbaabbAababa

put A=epsilon

ab(bbaabbaa)(bba)(baba)​​​​​​​

you can see that there is a loop between A and B

so we can say

 L = { ab(bbaa)^n bba (ba)^n / n>= 0 }
selected by

Related questions

577
views
1 answers
2 votes
dd asked Dec 8, 2016
577 views
... ..better explanation if possible.??
302
views
2 answers
0 votes
moe12leb asked Jan 21, 2023
302 views
what is the langauge generated by this grammar ?S-->aS | aSbS | ε what is the language
373
views
1 answers
0 votes
rd8794 asked Oct 15, 2022
373 views
how shall we prove or verify that { ( a^n!) , n>=0 } is not a CFG.I tried applying pumping lemma but got stuck.
465
views
1 answers
0 votes
aditi19 asked Oct 23, 2018
465 views
L=0^i 1^j 2^k | i=j or j=kis the grammar DCFG?