0 votes 0 votes Theory of Computation finite-automata + – Adittya asked Oct 8, 2018 Adittya 342 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes DFA where no symbol appears at consecutive positions Mk Utkarsh answered Oct 8, 2018 Mk Utkarsh comment Share Follow See all 4 Comments See all 4 4 Comments reply Adittya commented Oct 8, 2018 reply Follow Share Thanks brother!! 0 votes 0 votes Mk Utkarsh commented Oct 8, 2018 reply Follow Share Transitions are messed up so a little explanation, every other state on seeing a will goto $Q_1$ every other state on seeing b will goto $Q_2$ every other state on seeing c will goto $Q_3$ every other state on seeing a will goto $Q_4$ from these states if again that symbol is seen then goto Trap state ($Q_5$). $Q_0$ is initital state $Q_1 , Q_2 , Q_3, Q_4$ are final states $Q_5$ is trap state 0 votes 0 votes Shaik Masthan commented Oct 8, 2018 reply Follow Share @Mk brother, what is the software you used? 0 votes 0 votes Mk Utkarsh commented Oct 8, 2018 reply Follow Share Jflap It's a nice software for Automata, specially for checking. 1 votes 1 votes Please log in or register to add a comment.