Question
In an automata or formal-language problem, which option best represents non-regular language?
Select an option. Your answer will be checked instantly.
Correct Answer: C. a language that cannot be accepted by any finite automaton
Explanation:
In this course context, non-regular language means a language that cannot be accepted by any finite automaton.
Leave a Reply