Course Code: 171CS4T06

ADITYA ENGINEERING COLLEGE (A)

B.Tech IV Semester End Examinations (Regular), May / Jun – 2019
FORMAL LANGUAGES AND AUTOMATA THEORY
(Common to CSE & IT)
Time: 3 Hours Max. Marks: 60
Answer ONE question from each unit
All Questions Carry Equal Marks
All parts of the questions must be answered at one place only
UNIT – I
1 a Explain the working of a Finite Automaton with a neat diagram? CO 1 [6M]

b Design a DFA for the language over the alphabet {0, 1} whose strings CO 6 [6M]
end with 01.
OR
2 a Define a NDFA formally. Explain the difference between direct and CO 1 [6M]
indirect transition functions.
b Construct a Melay machine that computes the 2’s complement of a CO 6 [6M]
given binary number.
UNIT – II
3 a Write the identity rules for regular expressions. CO 2 [6M]
b Draw the NFA for the regular expression (0+1)*(111+000)(0+1)*? CO 6 [6M]
OR
4 a State and prove pumping lemma for regular languages. CO 4 [6M]
b Prove the language L= {a p | p is prime} is not regular. CO 4 [6M]

UNIT – III
5 a Describe Chomsky classification in detail. CO 3 [6M]
b What is an ambiguous grammar? Explain with an example. CO 3 [6M]
OR
6 a Define CNF. Convert the CFG S->S*S | S+S | a | b into CNF CO 3 [6M]
b State and prove pumping lemma for CFLs. CO 4 [6M]
UNIT – IV
7 a Explain the working of PDA with a neat diagram? CO 1 [6M]
b Design a DPDA. CO 6 [6M]
OR
8 a Explain the terms ID, Move with respective to a PDA. In how many CO 1 [6M]
different ways a PDA accepts a Language? Explain.
b Design a NDPDA CO 6 [6M]
UNIT – V
9 a Explain the working of TM with a neat diagram. CO 1 [6M]
b Design a TM for the language L ={1n2n3n | n>0}? CO 6 [6M]
 OR
10 a Briefly explain various types Turing Machines. CO 1 [6M]
b Prove PCP is Undecidable? CO 5 [6M]
*****