Question: Prove that the language L = { a m b n | n 2 m } is not regular using the Myhill - Nerode theorem.

Prove that the language
L={ambn|n2m}
is not regular using the Myhill-Nerode theorem.
Note that !inL, whereas a and ab belong to L.
Hint: Prove first that aLaa and aaLaaa.
Prove that the language L = { a m b n | n < 2 m }

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!