Printed Page: 1 of 3

Subject Code: BCS402

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

BTECH
(SEM IV) THEORY EXAMINATION 2023-24
THEORY OF AUTOMATA AND FORMAL LANGUAGES
TIME: 3 HRS M.MARKS: 70
Note: 1. Attempt all Sections. If require any missing data; then choose suitably.

SECTION A
1. Attempt all questions in brief. 2 x 7 = 14
a. Give the mathematical definition of DFA. Differentiate between NFA and
DFA.
b. Construct Deterministic Finite Automata (DFA) to accept string that always
ends with 101 over alphabet Σ ={0,1}
c. Give regular expressions that represent the language (L), which has all binary
strings having two consecutive 0s and two consecutive 1s over the alphabet Σ
= {0, 1}.
d. Compute the Language generated by the given CFG G = ({S}, {a, b}, P, S}
where P is defined by:
{S → SS, S → ab, S → ba, S → ε}
e. Let G be the grammar
S  0B | 1A

2
13
A  0 | 0S | 1AA 90
B  1 | 1S | 0BB

2.
_2
Determine the leftmost derivation for the string 00110101

24
f. Explain the concept of two stack PDA. Give an example of a language that is
P2

accepted by two stack PDA but not accepted by normal one stack PDA.

5.
g. Explain Multi Tape Turing Machine.
4E

.5
17
P2

SECTION B
2. Attempt any three of the following: |1
7 x 3 = 21
Q

a. Construct a Finite automata (DFA) which accepts all binary numbers whose
PM

decimal equivalent is divisible by 4 over Σ = {0, 1}.

b. Compute the regular expression using Arden`s Theorem for the following
DFA.
:32
31
1:
24

c. Write an equivalent left linear grammar from the given right linear grammar.
20

S0A |1B
g-

A0C |1A |0
Au

B1B |1A |1
C0 |0A
1-

d. Differentiate between DPDA and NPDA. Construct a PDA that accepts

|2

language L = {𝑎 𝑏 | 𝑛 1}.
e. Differentiate between Deterministic Turing machine and Non-Deterministic
Turing machine. Design a Turing machine for the language L={ww | w  (a +
b)*}.
1|Page

QP24EP2_290 | 21-Aug-2024 1:31:32 PM | 117.55.242.132

 Printed Page: 2 of 3
Subject Code: BCS402
0Roll No: 0 0 0 0 0 0 0 0 0 0 0 0 0

BTECH
(SEM IV) THEORY EXAMINATION 2023-24
THEORY OF AUTOMATA AND FORMAL LANGUAGES
TIME: 3 HRS M.MARKS: 70

SECTION C
3. Attempt any one part of the following: 7x1=7
a. Construct a DFA corresponding to the following NFA with 𝛜 moves:

b. Express in the minimum state automata equivalent to DFA described in below

figure:

2
13
90

2.
_2

24
P2

5.
4E

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

17
P2

a. State Pumping Lemma for Regular Language. Show that the given language
L={ap | Where p is a prime} is not regular. |1
Q

b. Discuss closure properties (i.e. union, concatenation, complement, intersection

PM

and difference) of regular language.

32

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

a. Reduce the given grammar G = ({S, A, B}, {a, b}, P, S) to Chomsky Normal
:
31

form. Where P is defined by:

S bA | aB
1:

A  bAA | aS | a
24

B aBB | bS | b
b. Design a CFG for the following language:
20

(i) L= {0m 1n | m ≠ n & m, n>=1}

g-

(ii) L= {ap bq cr | p + q = r & p, q > = 1}

Au
1-

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

|2

a. Construct PDA equivalent to the following CFG G = ({S, A}, {0,1}, P, S}

where P is defined by:
S 0S1 | A
A 1A0 | S | ε
2|Page

QP24EP2_290 | 21-Aug-2024 1:31:32 PM | 117.55.242.132

 Printed Page: 3 of 3
Subject Code: BCS402
0Roll No: 0 0 0 0 0 0 0 0 0 0 0 0 0

BTECH
(SEM IV) THEORY EXAMINATION 2023-24
THEORY OF AUTOMATA AND FORMAL LANGUAGES
TIME: 3 HRS M.MARKS: 70
b. Find the equivalent CFG of the following PDA
P = ({q0, q1,}, {a, b}, {a, z0}, δ, q0, z0) where δ is given by:
δ (q0, a, z0) = (q0, az0)
δ (q0, a, a) = (q1, aa)
δ (q1, a, a) = (q1, ε)
δ (q1, ε, z0) = (q1, ε)

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

a. Construct Turing Machine that accepts language L={𝑎 𝑏 | n>=1}. Also
show the instantaneous description for the string w = aaaabb.
b. Explain the any two of the following:
i. Universal Turing Machine.
ii. Post Correspondence Problem.
iii. Recursive and recursively Enumerable Languages

2
13
90

2.
_2

24
P2

5.
4E

.5
17
P2

|1
Q

PM
: 32
31
1:
24
20
g-
Au
1-
|2

3|Page

QP24EP2_290 | 21-Aug-2024 1:31:32 PM | 117.55.242.132

Printed Pages:02 Sub Code:KCS-402
Paper Id: 238248 Roll No.

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

SECTION A

1. Attempt all questions in brief. 2 x 10 = 20

(a) What do you understand by grammar?
(b) What do you mean by ε-Closure in FA?
(c) State Arden’s Theorem.
(d) State Kleen’s Theorem.
(e) Derive the CFG for (a+b)*.
(f) Explain Chomsky Hierarchy.
(g) Explain pumping lemma for context free language.
(h) Draw the graphical representation for PDA.
(i) Explain Halting Problem of Turing Machine.
(j) Explain Linear bounded Automata.
90

2
13
_2
SECTION B

2.
P2

24
2. Attempt any three of the following: 10x3=30
3E

5.
(a) Construct a DFA for ternary number divisible by 4.

.5
(b) Determine the FA accepted by the language described by the regular expression:
P2

(0+1)*0(0+1)*0(0+1)* over the alphabet {0,1} and also mention the accepted language
? 17
Q

|1
(c) Consider the grammar with following production rules:
S→ABD | AC
3

A→aA | bAa |a
:3

B→bbA | aB | AB
27

C→aCa |aD
D→aD | bC
:

Convert the above grammar into Chomsky Normal Form.

13

(d) Design a PDA for the language L= {WWT | W= (a+b)* }

3

(e) Write short notes on:

02

i) Church’s Thesis
ii) Recursive and Recursive Enumerable Language
-2
08

SECTION C
5-

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

|0

(a) Construct a DFA equivalent to the NFA

QP23EP2_290 | 05-08-2023 13:27:33 | 117.55.242.132

 (b) Construct a minimum state automata equivalent to a DFA whose transition table is
as follows where q3 and q4 are final state.

State/ Input
A b
Q0 Q1 Q2
Q1 Q4 Q3
Q2 Q4 Q3
Q3 Q5 Q6
Q4 Q7 Q6
Q5 Q3 Q6
Q6 Q6 Q6
Q7 Q4 Q6

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

(a) Find the regular expression corresponding to the finite automata given below:

(b) State pumping lemma for regular language. Prove that the language L= {ap | p is
prime} is not regular. 90

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

2.
P2

24
(a) A context free grammar G is given by the following productions:
E→E+E|E-E|E∗E|E^E|N
3E

5.
N→0|1|2|3|4|5|6|7|8|9

.5
P2

Determine whether the grammar G is ambiguous or not.If ambiguous then construct

an unambiguous grammar equivalent to G.
17
Q

(b) Explain Closure properties of regular language.

|1
3

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

:3

n n n
(a) Design a two stack PDA for the language L={a b c | n>=1}
27

(b) Generate CFG for the given PDA M is defined as

:

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

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

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

δ (q0, ε, x) = (q1, ε)
-2

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

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

5-
|0

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

(a) Design a Turing Machine for the language:
L={an bncn | n>=1}
(b) Write short notes on:
(i) Variants of Turing Machine
(ii) Post Correspondence problem
(iii) Universal Turing Machine

QP23EP2_290 | 05-08-2023 13:27:33 | 117.55.242.132

 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
32
SECTION B

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

1.
Q.no Questions Marks CO

24
P2

(a) Explain in detail about the Turing Church’s Thesis and Recursively 10 5

5.
Enumerable languages.
2E

.5
(b) Prove that the Compliment, Homomorphism, Inverse Homomorphism, 10 2
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

8

the same language by Empty stack.

:3

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

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

SECTION C
22

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

Q.no Questions Marks CO
20

(a) Write short notes on following. 10 5

-

i) Turing Machine as Computer of Integer Functions

08

ii) Universal Turing machine

0-

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

|1

Pumping Lemma for Regular Languages.

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_032 | 10-08-2022 13:23:38 | 117.55.241.2

 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

32

2
_0

1.
24
P2

5.
2E

.5
Figure A
P2

17
Q

|1
7. Attempt any one part of the following: 10x1 = 10
Q.no Questions Marks CO
8

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

:3

i) Closure properties of Regular Languages

23

ii) Decidability- Decision properties of Regular Languages

:
13

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

R-> R+R/ RR/ R*/ a / b / c. Obtain the string w = a+b*c
22
- 20
08
0-
|1

QP22EP2_032 | 10-08-2022 13:23:38 | 117.55.241.2

 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).