Printed Page: 1 of 2

Subject Code: KCS402

0Roll No: 0 0 0 0 0 0 0 0 0 0 0 0 0

BTECH
(SEM IV) THEORY EXAMINATION 2021-22
THEORY OF AUTOMATA AND FORMAL LANGUAGES

Time: 3 Hours Total Marks: 100

Note: Attempt all Sections. If you require any missing data, then choose suitably.

SECTION A
1. Attempt all questions in brief. 2x10 = 20
Q.no Questions Marks CO
(a) Define Alphabet and String in Automata Theory. 2 2
(b) Give the definition of Deterministic Finite Automaton (DFA). 2 1
(c) Explain in brief about the Kleen’s Theorem. 2 2
(d) Define Context Free Grammar (CFG). 2 1
(e) Write the Context Free Grammar (CFG) for regular expression (0+1)* 2 3
(f) What are Right Linear grammar and Left Linear grammars? 2 3
(g) Discuss briefly about the Push Down Automata (PDA). 2 4
(h) What do you mean by Two stack Pushdown Automata? 2 4
(i) What do you mean by basic Turing Machine Model? 2 5
(j) What do you understand by the Halting Problem? 2 5
90

2
SECTION B

13
2. Attempt any three of the following: 10x3 = 30
_2

Q.no Questions

2.
Marks CO
P2

24
(a) Explain in detail about the Turing Church’s Thesis and Recursively 10 5
Enumerable languages.
2E

5.
(b) Prove that the Compliment, Homomorphism, Inverse Homomorphism, 10 2
.5
P2

and Closure of a Regular Language is also Regular.

17
(c) Give the Complete description about the Chomsky Hierarchy. 10 3
Q

|1

(d) Convert the grammar S  aAA, A  a |aS| bS to a PDA that accepts 10 4

the same language by Empty stack.
4

(e) Grammar G is given with the production S->aSS A->b. Compute the 10 1
5
8:

string w= aababbb with the Left most and Right most derivation Tree.
:2
13

SECTION C
3. Attempt any one part of the following: 10x1 = 10
2

Q.no Questions Marks CO

02

(a) Write short notes on following. 10 5

-2

i) Turing Machine as Computer of Integer Functions

08

ii) Universal Turing machine

(b) Explain in detail about the Pumping Lemma and application of 10 2
0-

Pumping Lemma for Regular Languages.

|1

4. Attempt any one part of the following: 10x1 = 10

Q.no Questions Marks CO
(a) Construct a Non Deterministic Finite Automation (NFA) for the 10 1
language L which accepts all the strings in which the third symbol
from right end is always 'a' over  = {a, b}.
(b) Explain in detail about the Myhill-Nerode theorem using suitable 10 3
example.

QP22EP2_290 | 10-08-2022 13:28:54 | 117.55.242.132

 Printed Page: 2 of 2
Subject Code: KCS402
0Roll No: 0 0 0 0 0 0 0 0 0 0 0 0 0

BTECH
(SEM IV) THEORY EXAMINATION 2021-22
THEORY OF AUTOMATA AND FORMAL LANGUAGES

5. Attempt any one part of the following: 10x1 = 10

Q.no Questions Marks CO
n n
(a) Prove that the following Language L = {a b : n>=0} is not a regular 10 4
language.
(b) Design a Turing Machine for the language L. Where, L={anbncn| n≥1} 10 5

6. Attempt any one part of the following: 10x1 = 10

Q.no Questions Marks CO
(a) Prove that the Compliment, Homomorphism, Closure and Inverse 10 2
Homomorphism of a Regular language is also Regular.
(b) Minimize the given DFA shown below (Figure A). 10 1

90

2
13
_2

2.
P2

24
2E

5.
Figure A
.5
P2

17
Q

7. Attempt any one part of the following: 10x1 = 10

|1

Q.no Questions Marks CO

(a) Explain in detail about the following. 10 4
54

i) Closure properties of Regular Languages

8:

ii) Decidability- Decision properties of Regular Languages

:2

(b) Check whether the grammar is ambiguous or not. 10 3

13

R-> R+R/ RR/ R*/ a / b / c. Obtain the string w = a+b*c

2
02
-2
08
0-
|1

QP22EP2_290 | 10-08-2022 13:28:54 | 117.55.242.132

 RCS403

Printed Pages: 02 Sub Code: RCS403

Paper Id: 110257 Roll No.
B TECH
(SEM-IV) THEORY EXAMINATION 2018-19
THEORY OF AUTOMATA AND FORMAL LANGUAGES

Time: 3 Hours Total Marks: 70

Note: Attempt all Sections. If require any missing data; then choose suitably.

SECTION A

1. Attempt all questions in brief. 2 x 7 = 14

a. For the given language L1 = ε, L2 = {a}, L3 = Ø. Compute L1 L2* U L3*.
b. Design a FA to accept the string that always ends with 101.
c. Write regular expression for set of all strings such that number of a’s divisible
by 3 over Σ = {a,b}
d. Construct the CFG for the Language L = {a2nbn |n>=3}.
e. What do you mean by ε-Closure in FA?
f. Explain Universal TM.

A
g. Explain Two Stack PDA.

PT
SECTION B

2. Attempt any three of the following:

U 7 x 3 = 21
G

.2
a. Construct a minimum state DFA from given FA
AR

62
M

5.
KU

11
5.
Y

|4
JA

27
VI

7:
R

:5
D

Fig. 1
08

b. Find the regular expression corresponding to the finite automata given bellow:
9
01
-2
ay
M
4-
|1

Fig. 2

P.T.O

Page 1 of 2

DR VIJAY KUMAR GUPTA | 14-May-2019 08:57:27 | 45.115.62.2

 RCS403

c. Convert the following CFG to its equivalent GNF:

S → AA | a, A → SS | b.
d. Design a PDA for the following language:
L = {aibjck | i = j or j = k}
e. Design a TM for the following language:
L = { an+2bn | n >0 }

SECTION C
3. Attempt any one part of the following: 7x1=7
(a) Design FA for ternary number divisible by 5.
(b) Explain Myhill-Nerode Theorem using suitable example.

4. Attempt any one part of the following: 7x1=7

n n
(a) Prove that the following Language L = {a b } is not regular
(b) Explain the Closure properties of regular expression.

A
5. Attempt any one part of the following: 7x1=7

PT
(a) Design the CFG for the following language:
i) L = {0m1n | m ≠ n & m,n ≥ 1}
U
G
ii) L = {albmcn | l + m = n & l,m ≥ 1}

.2
AR

(b) Prove that the following Language L = {anbncn} is not Context Free.

62
M

5.
6. Attempt any one part of the following: 7x1=7
KU

11
R *
(a) Design a PDA for the Language L ={WW | W={a,b} }
(b) Generate CFG for the given PDA M is defined as
5.
Y

|4
M = ({q0, q1}, {0,1} {x, z0}, δ, q0, z0, q1) where δ is given as follows:
JA

δ (q0,1, z0) = (q0, xz0)

27
VI

δ (q0,1, x) = (q0, xx)

7:

δ (q0,0, x) = (q0, x)
R

:5

δ (q0, ε, x) = (q1, ε)
D

δ (q1, ε, x) = (q1, ε)
08

δ (q1,0, x) = (q1, xx)

9

δ (q1,0, z0) = ( q1, ε)

01
-2

7. Attempt any one part of the following: 7x1=7

ay

(a) Design a TM for the following language:

L = { anbncn | n≥ 1}
M

(b) Write short note on:

4-

i) Recursive Language and Recursively Enumerable Language.

|1

ii) PCP problem and Modified PCP Problem

Page 2 of 2

DR VIJAY KUMAR GUPTA | 14-May-2019 08:57:27 | 45.115.62.2

Printed Pages: 03 Sub Code: RCS403
Paper Id: 110433 Roll No.

B. TECH
(SEM IV) THEORY EXAMINATION 2017-18
THEORY OF AUTOMATA AND FORMAL LANGUAGES
Time: 3 Hours Total Marks: 70
Note: Attempt all Sections. If require any missing data; then choose suitably.

SECTION A

1. Attempt all questions in brief. 2 x 7 = 14

a. Define alphabet, string and language.
b. Design a regular expression that accepts all the strings for input alphabet {a,b}
containing exactly 2 a’s.
c. Design a NFA that accepts all the strings for input alphabet {a,b} containing
the substring abba.
d. Define Chomsky hierarchy.
e. Is context free language closed under union? If yes, give an example.
f. Convert NFA into equivalent DFA by taking any suitable example.
g. Remove useless productions from the given productions: SAB|ab,
AaA|B|a, BD|E

SECTION B

2. Attempt any three of the following: 7 x 3 = 21

a. Define Deterministic Finite Automata (DFA) and design a DFA that accepts
the binary number whose equivalent is divisible by 5.
b. State recursive definition of regular expression and construct a
regularexpression corresponding to the state transition diagram as shown in
Fig.1

Fig.1
c. Reduce the given grammar G=({S,A,B},{a,b},P,S) to Chomsky Normal Form.
Where P is defined as:
S→ bA | aB
A→ bAA | aS | a
B → aBB | bS | b
d. What is Push Down Automata (PDA)? Design the PDA for the language
L = {wcwR│w{a,b}*}
e. Define Turing Machine (TM). Construct the TM for the language
L = {anbn│n>0}.
 SECTION C
3. Attempt any one part of the following: 7x1=7
(a) Describe Mealy and Moore machines with example. Convert the given Mealy
machine as shown in Fig. 2 into Moore Machine.

Fig. 2
(b) Construct the minimum state automata equivalent to DFA described by Fig. 3

Fig. 3
4. Attempt any one part of the following: 7x1=7
p
(a) State Pumping Lemma for regular sets. Show that the set L={a | p is a prime} is
not regular.
(b) Discuss closure properties i.e. concatenation, union, intersection, complement
of regular languages.
5. Attempt any one part of the following: 7x1=7
(a) Discuss inherent ambiguity of context free languages with suitable example.
Construct the context free grammar that accepts language L={aibjck| i = j or j =
k; i, j, k are positive integers}.
(b) Define parse tree. Find parse tree for the string abbcde considering the
productions-
SaAcBe
AAb
Ab
Bd
Is this ambiguous? Justify.
6. Attempt any one part of the following: 7x1=7
(a) Differentiate between deterministic PDA (DPDA) and non-deterministic PDA
(NPDA) with suitable example. Also discuss two stack PDA with example.
 (b) Construct a PDA equivalent to the following CFG productions:
S→aAA, A→aS│bS│a

7. Attempt any one part of the following: 7x1=7

(a) Write short notes on the following:
(i) Halting problem of Turing machine
(ii) Recursive Language
(iii) Variants of Turing Machine
(b) Define Post’s Correspondence Problem (PCP) and Modified PCP with its
applications. Find any three PCP solutions of the lists x=(b,bab3,ba) and
y=(b3,ba,a).