0 votes 0 votes Is the following DFA valid ?? Can we go to same state from a same state with different inputs ?? Theory of Computation finite-automata + – Bhumika Gupta asked Feb 11, 2018 edited Mar 14, 2019 by Naveen Kumar 3 Bhumika Gupta 492 views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply Mr.OOPs commented Feb 11, 2018 reply Follow Share It is Valid DFA because when the machine is in q0 state Its input alphabet a,b is deterministically going to another state q1. 0 votes 0 votes sumit goyal 1 commented Feb 11, 2018 reply Follow Share yes definitely 0 votes 0 votes Chandan_kumar_111 commented Mar 22, 2018 reply Follow Share Yes, the DFA is valid but the number of possible set of strings is infinite. 0 votes 0 votes Please log in or register to add a comment.
1 votes 1 votes S,it is a valid DFA bcz on each state there is a move for both input{a,b} and the given DFA accepting epsilon only on q0 state and q1 is a dead state. meethunjadhav answered Feb 11, 2018 meethunjadhav comment Share Follow See all 0 reply Please log in or register to add a comment.