Which of the following is an utility of state elimination phenomenon?
(a) DFA to NFA
(b) NFA to DFA
(c) DFA to Regular Expression
(d) All of the mentioned
I had been asked this question in class test.
The above asked question is from Conversion by Eliminating states in section Regular Expressions and Languages of Automata Theory