1 Define Deterministic Finite Automata.
2 Marks
2 Write W3 for alphabet set W={x,1}. 2 Marks
3 List any four applications of Finite machines. 2 Marks
4 Differentiate Klene + and Klene * operations with an example. 2 Marks
5 Write L3 for alphabet set L={0,1}. 2 Marks
6 List any four applications of Push down automata machines. 2 Marks
7 What is a regular expression? Represent binary numbers ending 2 Marks
with 101 using regular expression.
8 Define Non Deterministic Finite Automata. 2 Marks
9 Write L2 for alphabet set L={a,1}. 2 Marks
10 List any four applications of Push down automata machines. 2 Marks
11 Differentiate Klene + and Klene * operations with an example. 2 Marks
12 What is a regular expression? Represent odd binary numbers 2 Marks
using regular expression.
13 Let L={a,b}2 and M={0,1}2 . Generate the language X
5 Marks
Such that string in X={w/w ϵ ML }.
14 Explain any five operations on languages with examples. 5 Marks
15 Consider the language definition L={a2b2} , N={x2y2} , where D={W/Wϵ
NRLR ,where NR , LR are reverses of L, N respectively}. Write the string 5 Marks
set available in D.
16 Explain any four operations possible in languages with
5 Marks
suitable examples
17 Differentiate NFA and DFA 5 Marks
18 Design DFA to accept language contains binary numbers 5 Marks
not divisible by 2.
19 Differentiate ENFA and NFA. 5 Marks
20 Design DFA to accept language having Prefix 101. 5 Marks
27 Design automata using Thomson’s construction method for the 10 Marks
regular expression (10+1)*.(10)+11
28 Present Next state 10 Marks
state
0 1
->p {q,s} {p}
Q {p,r} {s,r}
R {q} {p,r}
*s {p,t} {s}
T {q} {p}
Construct equivalent DFA from the given NFA?
29 Minimize the given Automata using State equivalence method. 10 Marks
Presen Next state
t state
A b
P Q P
Q P S
*R Q R
->S R S
T Q P
30 Design automata using Thomson’s construction method for the 10 Marks
regular expression (a+b)*.(ab)+aa
31 Present Next state 10 Marks
state
A b ϵ
->p {q,s} {p} {q}
Q {p,r} {s,r} {s}
*r {q} {p,r} {p}
*s {p,t} {s} {q}
T {q} {p} {q,r} Construct equilant
DFA from the given
ENFA?
32 Minimize the given Automata using State equivalence method. 10 Marks
Presen Next state
t state
0 B
P Q P
->Q P S
*R Q R
*S R S
T Q P
21 Construct an equivalent DFA from the given NFA 10 Marks
Present Next state
state
0 1
P {q,s} {p}
->q {p} {s,r}
R {q} {p,r}
*s {p,r,t} {s}
T {q} {p}
22 Let P={x,y}2 and M={0,1}3 . Generate the language X
5 Marks
Such that string in X={w/wϵPM }.
23 Design automata using Thomson’s construction method for the 10 Marks
regular expression (0+1)*.(10)+10
24 Present Next state 10 Marks
state
A b ϵ
->p {q,s} {p} {q}
q {p,r} {s,r} {s}
*r {q} {p,r} {p}
*s {p,t} {s} {q}
t {q} {p} {q,r}
Construct equivalent DFA from the given ENFA?
25 Minimize the given Automata using State equivalence method. 10 Marks
Presen Next state
t state
a b
P R Q
->Q P S
R Q R
S P S
*T Q P
26 Construct an equivalent DFA from the given NFA 10 Marks
Present Next state
state
0 1
P {q,s} {p}
->q {p} {s,r}
R {q} {p,r}
*s {p,r,t} {s}
T {q} {p}
33 Differentiate Non deterministic Finite Automata and DFA 5 Marks
34 Design DFA to accept language contains binary language 5 Marks
ends with bab .
35 Differentiate Epsilon NFA and Non deterministic Finite 5 Marks
Automata.
36 Design DFA to accept language having Prefix 110. 5 Marks
37 Consider the language definition L={a2b2} , N={0212} , where D={W/Wϵ 5 Marks
NL }. Write the string set available in D.
38 Explain any four operations possible in strings 5 Marks
39 Differentiate Non deterministic Finite Automata and DFA 5 Marks
40 Design DFA to accept language contains even binary 5 Marks
numbers.
41 Let P={a,b}2 and M={0,1}3 . Generate the language X 5 Marks
Such that string in X={w/wϵPM }.
42 Consider the language definition L={a2b2} , N={0212} , where D={W/Wϵ 5 Marks
NRL }. Write the string set available in D.
