Question
In an automata or formal-language problem, which option best represents language {a^n b^n | n >= 0}?
Select an option. Your answer will be checked instantly.
Correct Answer: C. a standard example of a non-regular language
Explanation:
In this course context, language {a^n b^n | n >= 0} means a standard example of a non-regular language.
Leave a Reply