Question: Show language L= {a m b m c 2 m | m>= 0) is not regular Use pummping lemma conditions xy i z A ,
Show language L= {ambmc2m | m>= 0) is not regular
Use pummping lemma conditions
xyiz A, for each i 0
|y| > 0
|xy| p
In the form of xyz
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
