A regular language corresponds to __________
(a) An alphabet
(b) Set of strings over an alphabet
(c) A DFA only
(d) A DFA or an NFA
The question was posed to me in a national level competition.
Question is taken from Non-Deterministic Finite Automata topic in section Finite Automata and Regular Expression of Compiler