Computer Sciences > GATE 2015 SET-2 > Automata
The number of states in the minimal deterministic finite automaton corresponding to the regular expression (0 + 1)*(10) is _______.

Correct : 3

Similar Questions

Which of the following is/are undecidable?
#310 MSQ
Consider the 5-state DFA M accepting the language L(M) ⊂ (0 + 1)* shown below. For any string w ∈ (0 + 1)* let n0(w) be the number of 0′s in w and n1(w) be the...
#886 MSQ
Which one of the following regular expressions is equivalent to the language accepted by the DFA given below?
#910 MCQ

Related Topics

minimal DFA for regular expression GATE CS 2015 Set-2 Q39 states in DFA regular expression (0+1)*(10) computer science gate DFA construction questions minimal automaton states

Unique Visitor Count

Total Unique Visitors

Loading......

Question Options

Contributed by: