GATE | CS | 2014 | Set 1 | TOC | Finite Automata | Question 25

Last Updated :
Discuss
Comments

Which of the regular expressions given below represent the following DFA?

GATECS2014Q45

I) 0*1(1+00*1)*
II) 0*1*1+11*0*1
III) (0+1)*1

I and II only

I and III only

II and III only

I, II, and III

This question is part of this quiz :

Regular languages and finite automata,GATE-CS-2014-(Set-1),Finite Automata PYQ QUIZ GATE CS
Tags:
Theory of Computation
GATE
Share your thoughts in the comments