Question 109Asked in CIL MT Systems, 27 Feb 2020 (8:00 AM)

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?
  1. A(b + a + b)*a
  2. Bb + (a + b)*b
  3. Cb + a*b*
  4. Db + a*b
Show answerHide answer

Correct answer: (A) (b + a + b)*a

From CIL MT Systems PYQ, 27 Feb 2020 (8:00 AM)

This is question 109 of CIL MT Systems PYQ, 27 Feb 2020 (8:00 AM). See all questions of this paper with answers, or attempt the paper as a timed online test to get your score and all-India rank.