A finite automaton accepts which type of language:
(a) Type 0
(b) Type 1
(c) Type 2
(d) Type 3
This question was addressed to me in my homework.
This intriguing question originated from Operators of Regular Expression in division Regular Expressions and Languages of Automata Theory