UTpaper

Free mock tests & test series

Question 120Asked in BEL PE Computer Science, 17 Dec 2023 (8:30 AM)

The given finite automata is equivalent to which of the following regular expression?

The given finite automata is equivalent to which of the following regular expression? States: q0 (start), q1, q4, q5, q2 and qf (final). Transitions: q0 –a→ q1; q1 –b→ qf; q0 –a→ q4; q4 –a→ q2; q0 –b→ q5; q5 –b→ q2; q2 –a,b→ q2 (self loop); q2 –b→ qf.
  1. Aab (aa + b) (a + b)* a
  2. Bab (aa + bb) (a + b)* b
  3. C(a + b)* (aa + bb) (a + b)*
  4. Dab + (aa + bb) (a + b)* b
Show answerHide answer

Correct answer: (D) ab + (aa + bb) (a + b)* b

From BEL PE Computer Science PYQ, 17 Dec 2023 (8:30 AM)

This is question 120 of BEL PE Computer Science PYQ, 17 Dec 2023 (8:30 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.