A Language for which no DFA exist is a________
(a) Regular Language
(b) Non-Regular Language
(c) May be Regular
(d) Cannot be said
I got this question in my homework.
My question is from Deterministic Finite Automata-Introduction and Definition topic in section Finite Automata of Automata Theory