GATEverse
← GATE CSE 2015 Set 2

Q53

NAT2 marks

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

Sign in to save attempts.

Loading…