Question
Which statement correctly describes non-regular language?
Select an option. Your answer will be checked instantly.
Correct Answer: B. a language that cannot be accepted by any finite automaton
Explanation:
non-regular language is correctly described as a language that cannot be accepted by any finite automaton.
Leave a Reply