XAVIER UNIVERSITY BHUBANESWAR

Xavier School of Computer Science & Engineering

B. Com. & BBM
BATCH 2017-21/ TERM V (END TERM)
Formal Languages and Automata Theory

DURATION: 02:00 Hours

FULL MARK: 40
INSTRUCTIONS TO THE STUDENTS:

1. Answer any EIGHT Questions.

2. Candidates have to answer all parts of a particular Question at one place only.

3. The figures in the Right hand margin indicate full marks.

1. Describe the Chomsky’s hierarchy of languages. [5]

2. Considering the DFA M0 in Fig. 1 determine and note-down {Q, initials tate, δ, Σ, F }
[5]

a, b

b q5
a
a, b
a b

q0 a q1 b q2 b q3 a q4
start

Figure 1: DFA M0

3. Considering the DFA M1 in Fig. 2 Find the regular expression accepted by the language
of the DFA M1 [5]

b b a b

q0 a q1 q2
start
a

Figure 2: DFA M1

4. Given the language L1 = {01, 00, 100} over alphabet Σ = {0, 1}, Design a DFA for L1 .
Construct five strings which are in L∗ ? [5]

1 of 2
 5. Define finite automata. Explain the difference between NFA and DFA. Construct NFA
and DFA for L2 = {ab∗ } over alphabet Σ = {a, b} [5]

6. Construct NFA for a language L3 with regular expressionr =  + 0(01∗ 1 + 00)∗ 01∗ over
alphabet Σ = {0, 1} [5]

7. Use Pumping Lema to prove that L4 = {ank |k > 0, and n is a positive integer constant}
over alphabet Σ = {a}is not a regular language. [5]

8. Convert the NFA M3 in Fig. 3 to DFA [5]


a, b
start q0 q1 q2

a
a a, b

q3

Figure 3: DFA M3

9. Give regular expression for the below languages [5]

(a) L5 = {w|wcontains a single 1 only}

(b) L6 = {w|wevery 0 in w is followed by at least one 1}

10. Describe the Pumping Lema with an example. [5]

——————–End——————–

2 of 2