The GATE Grind

GATE 2007 CS – Question 75

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

How many states does the minimum automaton equivalent to the shown FSA have?

Diagram for GATE 2007 CS question 75
  1. 1
  2. 2
  3. 3
  4. 4

Practise this question in The GATE Grind →

Show answer and explanation

Correct answer: (B) 2

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 →