The GATE Grind

GATE 2009 CS – Question 41

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

The DFA shown accepts all strings over {0, 1} that

Diagram for GATE 2009 CS question 41
  1. begin with either0 or1.
  2. end with0.
  3. end with00.
  4. contain substring00.

Practise this question in The GATE Grind →

Show answer and explanation

Correct answer: (C) end with00.

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 →