Which of the following are not meant to specify a regular language?
(a) Regular Expression
(b) DFA
(c) NDFA and epsilon-NFA
(d) All of the mentioned
The question was asked in class test.
I need to ask this question from Testing Emptiness and Membership in division Properties of Regular Languages of Automata Theory