1 1 vote What is the difference between a dfa accepting epsilon moves and dfa accepting nothing? I have a dfa which has no states what will be the dfa this is regarding,this question https://gateoverflow.in/8362/gate2015-1-52 Theory of Computation minimal-state-automata theory-of-computation finite-automata number-of-states + – sripo 1.7k views answer comment Share Follow Print See 1 comment 1 1 comment reply Utkarsh Joshi commented Oct 18, 2018 reply Follow flag Saying DFA accepts EPSILON "MOVES" is incorrect! In fact, there won't be any epsilon move in case of a DFA. DFA can accept empty string i.e string with length 0. If a DFA doesn't have any final state,it accepts nothing i.e language accepted by DFA is an empty set. 0 0 replyShare Please log in or register to add a comment.