in Theory of Computation
337 views
0 votes
0 votes

in Theory of Computation
by
337 views

1 Answer

1 vote
1 vote

DFA where no symbol appears at consecutive positions

4 Comments

Thanks brother!!
0
0
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
0
@Mk

brother, what is the software you used?
0
0

Jflap It's a nice software for Automata, specially for checking.

1
1