Ask your own question, for FREE!
Computer Science 14 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!
Latest Questions
heartlessprophet: How do i get paid from work when im in job court ?
5 hours ago 0 Replies 0 Medals
Aubree: Guys, what does love feel like? I've been getting a tight chest and when I talk to him my heart rate hangs out around 100-120 beats per min, and when he doe
7 hours ago 8 Replies 1 Medal
KBaby: Any1 down to call
1 day ago 0 Replies 0 Medals
KBaby: Bored af lwk need sum1 to talk to
1 day ago 2 Replies 0 Medals
thereneelg: ok... anyone have advice?? ...I did Choir all throughout Middle school and have ALWAYS been put in Soprano those three years.
1 day ago 6 Replies 1 Medal
kamariana: The Byzantine Procopius is known for (5 points) reconquering much of the old Roma
2 days ago 0 Replies 0 Medals
chuckD: hellp!!! what does it mean to describe a scientist as skeptical Why is sceptical
2 days ago 2 Replies 1 Medal
DoltonCarlee: So like do y'all know anything about the first world war?
1 day ago 2 Replies 0 Medals
thehearken: anyone know how to explain this so its easier for me to understand? b(1)=2, b(n)=
1 day ago 5 Replies 2 Medals
Twaylor: test post
4 days ago 9 Replies 0 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!