NCS402

Printed Pages: 02 Sub Code: NCS402

Paper Id: 110248 Roll No.
B TECH
(SEM-IV) THEORY EXAMINATION 2018-19
THEORY OF AUTOMATA & FORMAL LANGUAGE
Time: 3 Hours Total Marks: 100
Note: 1. Attempt all Sections. If require any missing data; then choose suitably.
SECTION A

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

a. Design a DFA for languages L containing strings of 0 and 1’s where number of
0’s is not divisible by 3.
b. Write regular expression for a language containing strings of 0’s and 1’s
which does not end in ‘01’.
c. State and prove Arden’s Theorem.
d. What are various applications of Finite Automata?
e. What do you mean by inherently ambiguous grammars? Explain.
f. Prove or disprove the following regarding regular expressions:
*
i. ( R + S ) = R* + S *
[Link]

* *
ii. ( RS + R ) RS = ( RR* S )
g. Write CFG for language L = anbn where n>=0. Also convert it into CNF.
h. Differentiate DPDA with NPDA.
i. Define Recursive and recursively enumerable language
j. Explain Post Correspondence Problem.
SECTION B

2. Attempt any three of the following: 10 x 3 = 30

a. Define NFA. What are various points of difference between NFA and DFA?

b. What are various points of difference between Moore & Mealy Machine?
Explain the procedure to convert a moore machine into Mealy machine.

c. Define ambiguity. Show that the grammar G with following production is

ambiguous.
S → a | aAb | abSb, A → aAAb | bS

d. Construct a PDA M equivalent to grammar with following productions:

S → aAA , A → aS / bS / a
Also, check whether the string ‘abaaaa’ is in M or not.

e. Define PCP. Let A = {1, 110, 0111} and B = {111, 001, 11} and  = {0, 1}.
Find the solution of PCP.

Page 1 of 2

[Link]
 NCS402

SECTION C
3. Attempt any one part of the following: 10 x 1 = 10
(a) Minimize the following Automata:

(b) Convert the following NFA { p, q, r , s} , {0,1} , δ , p, {q, s} into DFA where δ is
given by
0 1
→p q, s q
*q r q, r
R s p
*s φ p
[Link]

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

(a) Find the regular expression of Given FA using Arden’s theorem.

(b) Using pumping lemma for Regular languages prove that language
2
L = 0n , n >= 1 is not regular.

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

(a) Convert the following grammar in GNF: S → AB , A → BS / a , B → SA / b
(b) Define derivation Tree. Show the derivation tree for string ‘aabbbb’ with the
following grammar SAB/Є, AaB, BSb.

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

(a) Design PDA for Language WcW R , W ∈ ( a , b ) *
(b) Design a two stack PDA for the language L = a nb m c n d m where n, m ≥ 1

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

(a) Design a Turing machine for language containing palindromes of a’s and b’s.
(b) Write short note on any two:
i. Properties of recursive & recursive enumerable languages.
ii. Variants of Turing Machine.
iii. Universal Turing Machine.

Page 2 of 2

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

[Link]
(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 [Link] | [Link]

 (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 [Link] 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 [Link] | [Link]

 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
[Link] 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

SECTION B
2. Attempt any three of the following: 10x3 = 30
[Link] Questions Marks CO
(a) Explain in detail about the Turing Church’s Thesis and Recursively 10 5
Enumerable languages.
(b) Prove that the Compliment, Homomorphism, Inverse Homomorphism, 10 2
and Closure of a Regular Language is also Regular.
(c) Give the Complete description about the Chomsky Hierarchy. 10 3
(d) Convert the grammar S  aAA, A  a |aS| bS to a PDA that accepts 10 4
the same language by Empty stack.
(e) Grammar G is given with the production S->aSS A->b. Compute the 10 1
string w= aababbb with the Left most and Right most derivation Tree.

SECTION C
3. Attempt any one part of the following: 10x1 = 10
[Link] Questions Marks CO
(a) Write short notes on following. 10 5
i) Turing Machine as Computer of Integer Functions
ii) Universal Turing machine
(b) Explain in detail about the Pumping Lemma and application of 10 2
Pumping Lemma for Regular Languages.

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

[Link] 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.
 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

[Link] 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

[Link] 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

Figure A

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

[Link] Questions Marks CO
(a) Explain in detail about the following. 10 4
i) Closure properties of Regular Languages
ii) Decidability- Decision properties of Regular Languages
(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