Scribd
Upload
27 views

Formal Language and Automata Theory 20CSC19

The document is an examination paper for B.E. (CSE) students at Chaitanya Bharathi Institute of Technology, focusing on Formal Languages and Automata Theory. It includes two parts: Part A with five questions worth 3 marks each and Part B with five questions worth 9 marks each, covering topics such as DFA construction, regular expressions, ambiguous grammar, and Turing machines. The exam is scheduled for December 2022 / January 2023 and has a total of 60 marks.

Uploaded by

saikarthikreddypalagiri
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
27 views

Formal Language and Automata Theory 20CSC19

The document is an examination paper for B.E. (CSE) students at Chaitanya Bharathi Institute of Technology, focusing on Formal Languages and Automata Theory. It includes two parts: Part A with five questions worth 3 marks each and Part B with five questions worth 9 marks each, covering topics such as DFA construction, regular expressions, ambiguous grammar, and Turing machines. The exam is scheduled for December 2022 / January 2023 and has a total of 60 marks.

Uploaded by

saikarthikreddypalagiri
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/ 2

Code No.

: 20CSC19

CHAITANYA BHARATHI INSTITUTE OF TECHNOLOGY (Autonomous)


B.E. (CSE) V Sem (Main) Examination Dec 2022 / Jan 2023
Formal Languages and Automata Theory
Time: 3 Hours Max Marks: 60
Note: Answer ALL questions from Part-A & Part –B (Internal Choice) at one place in the
same order
Part - A
(5Q X 3M = 15 Marks)
M CO BT
1 Construct a DFA that accepts all the string ending with ‘bab’ for ⅀={a,b} (3) 1 2
2 Obtain a regular expression to accept strings of a’s and b’s whose length is (3) 2 2
either even or multiples of 3 or both.
3 What is an ambiguous grammar? How ambiguity can be removed? (3) 3 1
4 Define the term LBA and explain. (3) 4 2
5 What is undecidability give an example (3) 6 2

Part – B
(5Q X 9M = 45 Marks)
M CO BT
6 (a) Construct DFA to accept decimal strings divisible by 3. (5) 2 2
(b) Construct DFA for the language L = {W | W does not contain the (4) 2 3
substring 101}.
(OR)
7 (a) Define ε-closure of a state and explain with a suitable example. (5) 1 2
(b) Convert the following NFA to DFA (4) 1 2
∂ 0 1
Initial state p {p,q} p
q r r
r s
*s s

8 (a) Convert the finite automata to regular expression (5) 2 3


∂ 0 1
*->q0 q1 q2
q1 q3 q0
q2 q0 q3
q3 q3 q3
(b) Explain briefly about minimization of finite automata with appropriate (4) 2 3
example.
(OR)
9 (a) Using Pumping lemma prove whether the following language is (5) 4 3
regular or not? C = {w | w has an equal number of 0’s and 1’s}
(b) Write the regular expression for the language. (4) 3 4
L={anbm / n+m is even}

Page 1 of 2
Code No.: 20CSC19

10 (a) Reduce the following grammar to CNF, (5) 3 3


S  aB/ab
A  aAB/a
B  ABb/b
(b) Construct PDA that recognize the language {0n 1n | n ≥ 1}. (4) 4 3
(OR)
11 (a) Given a CFG. (5) 3 2
EE+T/T
TT*F/F
F  (E) / a
Give parse Tree and derivation (both LMD and RMD) for a data.
Verify whether grammar is ambiguous / not.
(b) Using pumping lemma prove L = {wwR / wε {0,1}} is not CFL. (4) 3 2

12 (a) Define and describe the model Linear bounded automata. (5) 5 2
(b) Explain about basic model of Turing Machine. (4) 5 2
(OR)
n n
13 (a) Design a TM that accepts L={ a b /n>= 1} (5) 5 3
(b) Explain about Extensions to the Turing machines. (4) 5 2

14 (a) State and explain Rice’s Theorem. (5) 6 3


(b) What are recursively enumerable languages? Give example. (4) 6 2
(OR)
15 (a) Show that PCP (Post correspondence Problem) with two lists (5) 6 3
x = (b, bab3, ba) and y = (b3, ba, a) has a solution give the solution
sequence.
(b) Explain Halting or undecidable problem of TM. (4) 5 2

******

Page 2 of 2

You might also like