Computer Sciences > GATE 2014 SET-1 > Automata
Which of the regular expressions given below represent the following DFA?
I) 0*1(1 + 00*1)*
II) 0*1*1 + 11*0*1
III) (0 + 1)*1
II) 0*1*1 + 11*0*1
III) (0 + 1)*1
Correct : b
Similar Questions
Which of the following is/are undecidable?
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...
Which one of the following regular expressions is equivalent to the language accepted by the DFA given below?
Total Unique Visitors
Loading......