Question
What is meant by non-regular language in Theory of Automata and Formal Languages?
Select an option. Your answer will be checked instantly.
Correct Answer: D. a language that cannot be accepted by any finite automaton
Explanation:
The correct answer is a language that cannot be accepted by any finite automaton.
Leave a Reply