Question: Prove whether the following is a regular language or not. If the language is regular, give a NFA, or use pumping lemma to prove the
Prove whether the following is a regular language or not. If the language is regular, give a NFA, or use pumping lemma to prove the language is not regular
L = {an^2 | n 1}.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
