Scribd
Upload
48 views3 pages

20BS1403

Uploaded by

techw378
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
48 views3 pages

20BS1403

Uploaded by

techw378
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

PVP 20

Code: 20BS1403

II B.Tech - II Semester – Regular / Supplementary Examinations


MAY - 2024

FORMAL LANGUAGES AND AUTOMATA THEORY


(Common for CSE, AIML, DS)
Duration: 3 hours Max. Marks: 70
Note: 1. This paper contains questions from 5 units of Syllabus. Each unit carries
14 marks and have an internal choice of Questions.
2. All parts of Question must be answered in one place.
BL – Blooms Level CO – Course Outcome

Max.
BL CO Marks
UNIT-I
1 a) How does Automata Theory contribute to L2 CO1 7 M
advancements in technology and software
development?
b) What is Automata? Explain classification of L2 CO1 7 M
Automata.
OR
2 a) Explain the design of a finite state machine with L4 CO4 7 M
an example.
b) Design DFA for the language L3 CO2 7 M
L={aaa,aaaa,baaa,aaaaa,abaaa,baaaa,bbaaa,
aaaaaaa,……}

Page 1 of 3
UNIT-II
3 a) Convert the following Finite automata to regular L3 CO2 7 M
expression.

b) Construct a NFA equivalent to the regular L3 CO2 7 M


expression 10(0+11)0*1.
OR
4 a) Write in brief about the algebraic rules for L2 CO2 7 M
regular expressions.
b) Discuss in brief about applications of pumping L2 CO2 7 M
lemma for regular language.
UNIT-III
5 a) Simplify the following CFG and Convert it into L3 CO2 7 M
CNF.
S -> AaB | aaB
A -> ε
B -> bbA | ε
b) Simplify the following CFG with no useless L3 CO2 7 M
symbols.
S -> AB | DA
B -> BD | AB
D -> aB | b
A -> a
Page 2 of 3
OR
6 a) Write in detail the Chomsky hierarchy of formal L2 CO2 7 M
languages.
b) Check whether the language L = {anbncn|n>=0} is L3 CO2 7 M
context free or not.
UNIT-IV
7 a) Design PDA that accepts Language L3 CO2 7 M
R *
L = {wcw |w in (0+1) }, by empty stack. Where
wR is the reverse of w.
b) Construct PDA equivalent to the following L4 CO4 7 M
grammar.
S -> aAA
A -> aS | bS | a
OR
8 a) Define Push Down Automata. Explain the basic L2 CO2 7 M
structure of PDA with a neat graphical
representation.
b) Construct a PDA that accepts L = {0n1n | n ≥ 0}. L3 CO2 7 M
UNIT-V
9 a) Design a Turing Machine to accept L3 CO3 7 M
L= {0n1n0n | n ≥ 1}.
b) Explain about Universal Turing Machine. L2 CO3 7 M
OR
10 a) Let A and B be lists of three strings each L3 CO3 7 M
List A List B
i wi xi
1 1 111
2 10111 10
3 10 0
Check whether this PCP has a solution or not.
b) What is Halting Problem of Turing Machine? Is L3 CO3 7 M
it decidable or not? Explain.
Page 3 of 3

You might also like