GATE 1994

2. The regular expression for the language recognized by the finite state
automaton of figure is __________

0 1
0,1

1 0
A B C
GATE 2006 (IT)
12. Which regular expression best describes the language accepted by the non-
deterministic automaton below?
a.b

a a.b b
s s s t

(A)  a  b  * a  a  b  b (B) (abb)*

(C)  a  b * a  a  b * b  a  b (D) (a + b)*

GATE 2006 (IT)

15. Which one of the regular expressions given below defines the same language
as defined by the regular expression R?

(A)  a  ba   b  ab    a  b 
   
a s1
a
s3
a

(B)  a  ba   b  ab    a  b 
    s0 b a b a

 a ba   a  bb   b  ab  b  aa   a  b 
b s2 s4
(C)
  
b
b

(D)  a ba   a  bb   b  ab  b  aa   a  b 
  
GATE 2007
Common Data for Questions: 16 & 17
Consider the following Finite State Automaton:
16. The language accepted by this automaton is given by the regular
q
expression
3

(A) b*ab*ab* ab*

a
(B) a  b b b b
*

(C) b* a  a  b 
*
a q2 b
q0 q1
a
(D) b*ab*ab* a
17. The minimum state automaton equivalent to the above FSA has the following
number of states
(A) 1 (B) 2
(C) 3 (D) 4
GATE 2008 part A
Which of the following correctly represents the regular expression for the given NFA?

(A)   0  01 * 1  00  * 01 * 1

(B)   0 10 * 1  00  * 0 1
0
(C)   0 10 * 1  10  * 1 0

(D)   0 10 * 1  10  * 10 * 0
GATE 2008 part B
Which of the following correctly represents the regular expression for the given NFA?

(A)   0  01 * 1  00  * 01 * 1

(B)   0 10 * 1  00  * 0
0
  0 10 * 1  10  * 1
1
(C) 0

(D)   0 10 * 1  10  * 10 * 0
GATE 2008 part c
Which of the following correctly represents the regular expression for the given NFA?

  0  01 * 1  00  * 01 *
1
(A)
(B)   0 10 * 1  00  * 0 0
1

(C)   0 10 * 1  10  * 1 0

  0 10 * 1  10  * 10 *
1
(D)
GATE 2008 part c
Which of the following correctly represents the regular expression for the given NFA?

  0  01 * 1  00  * 01 *
1
(A)
(B)   0 10 * 1  00  * 0 0
1

(C)   0 10 * 1  10  * 1

  0 10 * 1  10  * 10 *
0 1
(D)
GATE 2008 (IT)
20. If the final states and non-final states in the DFA below are interchanged, then
which of the following languages over the alphabet {a, b} will be accepted by
b a
the new DFA?
a b
(A) Set of all strings that do not end with ab
(B) Set of all strings that begin with either an a or a b a
b
(C) Set of all strings that do not contain the substring ab
(D) The set described by the regular expression b*aa*(ba)*b*
GATE 2009
21. Which one of the following languages over the alphabet {0,1} is described by
the regular expression: (0+1)*0(0+1)*0(0+1)*?
(A) The set of all strings containing the substring 00.
(B) The set of all strings containing at most two 0’s.
(C) The set of all strings containing at least two 0’s.
(D) The set of all strings that begin and end with either 0 or 1.
GATE 2014
25. Which of the regular expressions given below represent the following DFA?

0 0 1

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

(A) I and II only (B) I and III only
(C) II and III only (D) I, II, and III
GATE 2015
44. Let an represent the number of bit strings of length n containing two
consecutive 1’s. What is the recurrence relation for an?
(A) an–2 + an–1 + 2n–2 (B) an–2 + 2an–1 + 2n–2
(C) 2an–2 + an–1 + 2n–2 (D) 2an–2 + 2an–1 + 2n–2
GATE 2016
Let an be the number of n-bit strings that do NOT contain two consecutive 1s.
Which one of the following is the recurrence relation for an?
(A) 2an–2 + an–1 (B) an–2 + an–1
(C) an–2 + 2an–1 (D) 2an–2 + 2an–1