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