Well in my class, we use a program that allows us to draw the dfa and then type in the requirements of a string to land on that state. Then there is a feature to check it for us and tell if our conditions are right. Like if I am supposed to design a dfa that recognizes strings of a and b that end in b. The conditions of the second and final state would be that the string ends in b.
|