ADITYA COLLEGE OF ENGINEERING & TECHNOLOGY

(Permanently Affiliated to JNTUK, Kakinada, Approved by AICTE, New Delhi)

Recognized by UGC Under Section (2f) and 12(B) of UGC Act 1956
Aditya Nagar, ADB Road, Surampalem,
II B.TECH - II SEMESTER R20 Regulations
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
FORMAL LANGUAGES AND AUTOMATA THEORY

QUESTION BANK MID - I

Q.No Question Marks CO RBT

UNIT I

1 A Define -CLOSURE() of a state and hence Construct equivalent 8 1 Apply

NFA with out -moves to the following NFA with -moves where
q0 is the initial state

B Define Moore and Mealy machines and hence give the difference 7 1 Analyse
between them
2 Construct a Moore machine which computes residue modulo 5 when 15 1 Apply
input is given in ternary notation justify your design with example
3 Minimize the following finite Automata where q1 is the initial state 15 1 Apply
and q6 is Final state
 0 1
q1 q2 q3
q2 q4 q5
q3 q6 q7
q4 q4 q5
q5 q6 q7
q6 q4 q5
q7 q6 q7
4 Construct the Equivalent Moore machine to the following Mealy 15 1 Apply
machine

UNIT II
1 State and prove Pumping lemma for regular sets 15 2 Analyse
2 Give applications of pumping lemma and hence Prove that 15 2 Apply
is not a regular set
3 A Give applications and Limitations of Finite Automata 7 2
B Construct NFA with  transitions to the following regular 8 2 Apply
expression
(00+10)*+(10*1+111)
4 A Find the language accepted by the following Finite Automata where 7 2 Apply
q1 is both initial and final state

B Construct DFA to the following regular expression 8 2 Apply

(00+10)*+(10*1+111)
UNIT III

1 A Explain Chomsky hierarchy of languages 7 3 Apply

B Define Ambiguous grammar and give example and prove it 8 3 Apply
ambiguous
2 A Define Context Free Grammar and hence construct context free 8 3 Apply
grammar to the context free language

B Define and demonstrate different types of derivations 7 3 Apply

3 Find the reduced grammar to the following context free grammar 15 3 Apply
S → ASA | aB | b
A → Ba/Xa
BZb/
XEXa
Da
Fb
Zm

4 A Define use full and useless symbols and hence find useful and 7 3 Apply
useless symbols in the following grammar
S → ASA | aB | b
A→B
B→b|D
DE
Fb
B Construct a DFA which accepts the language generated by the 8 3 Apply
following regular expression 10(0+11)0*1 and hence construct
regular grammar