Question: is this language regular or irregular? prove using pumping lemma {a n b m c k | n>5, m>3, k

is this language regular or irregular? prove using pumping lemma

{anbmck | n>5, m>3, k<=m}

can I use string: a6bpcp with p=4 and then continue with the proof? thanks

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 Databases Questions!