Question
What is meant by regular language in Theory of Automata and Formal Languages?
Correct Answer: B
a language that can be accepted by a finite automaton
The correct answer is a language that can be accepted by a finite automaton.
The correct answer is a language that can be accepted by a finite automaton.
Leave a Reply