Prove that the language L over {a, b} defined as L = {anba3n : n≠ 0} is not regular. If you removed the b from the defin
Posted: Sun May 15, 2022 10:25 am
Prove that the language L over {a, b} defined as L =
{anba3n : n≠ 0} is not regular. If
you removed the b from the definition, would the language be
regular? Don’t just say yes or no; demonstrate your answer is
correct.
{anba3n : n≠ 0} is not regular. If
you removed the b from the definition, would the language be
regular? Don’t just say yes or no; demonstrate your answer is
correct.