Consider the finite automaton with two states: the start state q0 and the final state q1. From q0, input a goes to q1 and input b loops back to q0. From q1,…
Consider the finite automaton with two states: the start state q0 and the final state q1. From q0, input a goes to q1 and input b loops back to q0. From q1, input a loops back to q1 and input b goes to q0. Which language is accepted by the FA?
Show answerHide answer
Correct answer: (A) (b + a + b)*a