GATE CS 2015 Set 3 — Question 33

Numerical answer 1 mark Question 33 2015

Question 33

NAT 1 marks · no negative Theory of Computation

The number of states in the minimal deterministic finite automaton corresponding to the regular expression \((0+1)^*(10)\) is ______.

Answers and explanations are free — they just need an account.

Where this question comes from

GATE CS — Computer Science & IT 2015 Theory of Computation

Source: GATE 2015 Computer Science and Information Technology, Set 3, Q33 (set and question number approximate)

All Theory of Computation questions