[Math] Finite automaton that recognizes the empty language $\emptyset$

automatacomputer scienceformal-languages

Since the language $L = \emptyset$ is regular, there must be a finite automaton that recognizes it. However, I'm not exactly sure how one would be constructed. I feel like the answer is trivial. Can someone help me out?

Best Answer

One state, non-accepting, and no transitions. (That’s an NFA; if you want a DFA, have one transition from the state to itself for each letter of whatever alphabet is specified.)

Best Answer

Related Solutions

[Math] For the regular expression, (a* + b*) . (a.b)* , does the following automaton recognise the language it describes

[Math] proving that a regular language can be accepted by a fast finite automaton

Related Question

[Math] For the regular expression, (a* + b) . (a.b) , does the following automaton recognise the language it describes