GATE CS 2022 (Forenoon) — Question 12

Theory of Computation (TOC)Regular Expressions & Finite Automata (DFA/NFA Min)MCQ1 mark · −1/3 if wrongMedium

Which one of the following regular expressions correctly represents the language of the finite automaton given below?
Question image
  1. A
    \(ab^*bab^* + ba^*aba^*\)
  2. B
    \((ab^*b)^* ab^* + (ba^*a)^*ba^*\)
  3. C
    \((ab^*b + ba^*a)^* (a^* + b^*)\)
  4. D
    \((ba^*a + ab^*b)^* (ab^* + ba^*)\)
Practise the full 2022-FN paper
Challenge a friend: WhatsApp Telegram
Recommended book · affiliate linkIntroduction to Automata Theory (Hopcroft & Ullman)Regular languages, CFGs, pushdown automata and Turing machines.
Practise more on Regular Expressions & Finite Automata (DFA/NFA Min)Timed, in the real exam interface · free to start

A GATE question every morning

One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.

Join
Stuck? Ask in the student group