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