Ask your own question, for FREE!
Computer Science 8 Online
OpenStudy (anonymous):

Create an Finite Automata that does not end at ab and ba only.

OpenStudy (anonymous):

What I do is write an automata that does end at 'ab' and 'ba'. Once I have that one, I 'invert' whether or not the automata accepts a state as end. So if in the automata I wrote a state is non accepting, it becomes a state that accepts the input, etc.

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Latest Questions
Arriyanalol: i need help
1 day ago 7 Replies 1 Medal
Arriyanalol: CONGRATS to me
1 day ago 8 Replies 2 Medals
Legomaster346: What colleges are good that are near Arab Alabama?
1 week ago 5 Replies 0 Medals
Arriyanalol: i need help
1 week ago 6 Replies 2 Medals
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!