Consider the FA shown in fig below which language is accepted by the FA:
2020
Consider the FA shown in fig below which language is accepted by the FA:
- A.
(b + a + b)*a
- B.
b + (a + b)*b
- C.
b + a*b*
- D.
b + a*b
Attempted by 131 students.
Show answer & explanation
Correct answer: A
The correct option is A. Let the initial state be q0 and the final state be q1. To reach the final state q1 and stay there, any sequence of inputs can be processed as long as the last symbol processed is 'a'. Every path ending at q1 must end with an 'a' transition from q0 or a self-loop 'a' on q1. Thus, the language consists of all strings over {a, b} ending with 'a', represented by (b + a + b)*a or simply (a+b)*a.