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
is not regular using the MyhillNerode theorem.
Note that inL, whereas a and belong to
Hint: Prove first that and aaa.
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
