Question
Which statement correctly describes regular language?
Correct Answer: C
a language that can be accepted by a finite automaton
regular language is correctly described as a language that can be accepted by a finite automaton.
regular language is correctly described as a language that can be accepted by a finite automaton.
Leave a Reply