Code No: A53K1 R 20A

BVRAJU INSTITUTE OF TECHNOLOGY, NARSAPUR

(UGC - AUTONOMOUS)
II B. Tech I Semester Supplementary Examinations, July- 2024
FORMAL LANGUAGE AND AUTOMATA THEORY
(COMPUTER SCIENCE AND BUSINESS SYSTEMS)
Time: 3 Hours Max Marks: 70
Note: This Question Paper contains two Parts A and B
 Part A is compulsory which carries 10 marks. Five questions from five units. Answer all questions in
Part A at one place only.
 Part-B consists of 10 Questions (numbered from 2 to 11) carrying 12 marks each. Each of these
questions is from one unit and may contain a, b, c as sub-questions. For each question there will be an
either/or choice (that means there will be two questions from each unit and the student should answer
only one question).

PART – A (5x2 = 10 Marks)

1. Marks Bloom Level CO
a Write the formal definition of Non-Deterministic Finite 2 1 1
Automata.

b Write a regular expression to represent the language of strings 2 3 2

with 1100 as a substring.
c Define Chomsky Normal Form. 2 1 3
d What is Unrestricted grammar? 2 1 4
e State Church-Turing thesis. 2 1 5

PART – B (5x12 = 60 Marks)

Marks Bloom Level CO
2 a)Design a NFA for a set of strings such that the 5th symbol from the 6 6 1
right end is 1 where input alphabet ∑={0,1}.
b)Design a DFA that accepts an even number of a’s and an even 6 6 1
number of b’s.
OR
3 Minimize the finite automata given below 12 4 1

***
4 a)Construct NFA for the following regular expression 6 4 2

(0+1)*01*+(10+11)1*0 6 4 2
 b) Convert the following DFA to regular expression

OR
5 a) Convert the following DFA to the right linear grammar: 6 4 2

b) Prove or disprove whether the following language is regular or 6 5 2

not using Pumping lemma. L={0n | n is a prime}

***
6 a)Construct equivalent grammar in Chomsky Normal Form for the 6 4 3
grammar
G=( {S,A,B},{a,b}, S->aAbB, A->aA/a, B->bB/b } ,S}
b) Design PDA that accepts the following language: 6 6 3
L={ wwR/ wε {a,b}* }
OR
7 a) Discuss closure properties of Context Free Languages in detail. 6 2 3
b) Write the context-sensitive grammar to accept the following 6 4 3
language : L = { anbncn| n≥1}.
***
8 Design Turing machines to recognize the languages 6 6 4
a) L = { 0n1n | n≥1}.
b) L={ w/ w ε {a,b}* and na(w)=nb(w) } 6 6 4
OR
9 a) Compare Recursive and Recursive enumerable languages in detail. 6 2 4
b) Discuss different types of Turing Machines in detail. 6 2 4
***
10 a)Define a universal Turing machine and explain how it can 6 2 5
simulate the behavior of any other Turing machine.
b) Discuss undecidable problems about languages. 6 2 5
OR
11 Discuss P, NP, and NP-complete problems with suitable examples 12 2 5
and also write the differences between them.
***