1,357 views
1 votes
1 votes

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

Please log in or register to answer this question.

Related questions

1 votes
1 votes
1 answer
1
Prajwal Bhat asked Jan 17, 2017
1,346 views
No. of states in the DFA accepting the following set of strings are:( ( aa* + φ* )* (aa* + φ* ) + bb* + φ* φ + φ* )*Quite confusing to me. Share your approach!
5 votes
5 votes
6 answers
3
dd asked Sep 24, 2016
3,087 views
$L = \left \{ a^nb \ ; n\geq 0 \right \} \cup \left \{ b^na \ ; n\geq 1 \right \}$Minimal DFA for the above language ?