Question: Consider the following languages over the binary alphabet {a, b}: L:={a^nb^m:nm} Answer if it is regular or not, and prove it, and explain.
Consider the following languages over the binary alphabet
{a, b}: L:={a^nb^m:nm}
Answer if it is regular or not, and prove it, and explain.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
