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