The GATE Grind

GATE 2007 CS – Question 74

Theory of Computation · Regular Expressions and Finite Automata · 2 marks · Multiple choice

Which regular expression gives the language of the automaton shown?

Diagram for GATE 2007 CS question 74
  1. $b^*ab^*ab^*ab^*$
  2. $(a+b)^*$
  3. $b^*a(a+b)^*$
  4. $b^*ab^*$

Practise this question in The GATE Grind →

Show answer and explanation

Correct answer: (C) $b^*a(a+b)^*$

Explanation

We are sorry we couldn't write detailed soluition for this, we are working on it!, please consider asking your own AI, its just 2-3 clicks with very minimum effort

More Regular Expressions and Finite Automata questions

All Regular Expressions and Finite Automata questions →