Question: The language a ^ ( n ) b ^ ( n - 3 + k ) n > = 3 , k = 1 ,

The language a^(n)b^(n-3+k)n>=3,k=1,3,5,7... is generated by the unrestricted grammar G
S->AbB
A->aAb
bB->bbbB
aAb->aaa
B-> lambda
Use the Pumping Lemma to show L is not regular, Is this language Context Free? (e.g. there is a Context Free Grammar for L(G) or there is an NPDA for L(G))

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Programming Questions!