Question: The language a ^ ( n ) b ^ ( n - 3 + k ) n > = 3 , k = 1 ,
The language anbnknk is generated by the unrestricted grammar G
SAbB
AaAb
bBbbbB
aAbaaa
B lambda
Use the Pumping Lemma to show L is not regular, Is this language Context Free? eg there is a Context Free Grammar for LG or there is an NPDA for LG
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
