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

build a finite automata that accept only those words that do not end with ba, with alphabet {a,b}. how to solve this question. how to know that what input we take. plz help me in this subject

OpenStudy (anonymous):

Can the word not end with 'a' or 'b' or 'ab' or 'ba'? Can the user enter any number of words? How does the user stop entering words?

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!
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!