Problem Detail: I am trying to generate a transition graph for a turing machine that accepts the languages of all strings that do not contain the substring $bbb$ with the input alphabet $Sigma = {a, b}$. When I implement this graph in JFLAP, I’m receiving an error that there are transitions out of final states. Is it OK to construct a transition graph like this, or is it considered bad practice? If so, can you help me understand the correct way to construct the transition graph? 
Asked By : Rusty
Answered By : jonaprieto
The state $q_3$ is not necessary, because you couldn’t have string with the pattern $bbb$ inside of them. So, just delete it. The next automaton accepts your language requirement. 
Hope it helps
Hope it helpsBest Answer from StackOverflow
Question Source : http://cs.stackexchange.com/questions/34035
