Professional Documents
Culture Documents
TAFL Model Paper
TAFL Model Paper
B TECH
MODEL PAPER-1
THEORY OF AUTOMATA AND FORMAL LANGUAGE (BCS-402)
----------------------------------------------------------------------------------------------------------------------------------
Note: Attempt all Sections. If require any missing data; then choose suitably.
SECTION-A
1. Attempt all questions in brief. 2 x 10 = 20
Q no. Question Marks CO
a. What are the different representational techniques of finite automata? 2 1
b. What do you understand by grammar? 2 1
c. Differentiate between DFA and NFA. 2 2
d. What do you mean by ε-Closure in FA? 2 2
e. What do you understand Ambiguity in CFG? 2 3
f. State Arden’s Theorem. 2 4
g. Discuss Turing thesis. 2 5
SECTION-B
2. Attempt any three of the following: 10 x 3 = 30
Q no. Question Marks CO
a. Construct a DFA for ternary number divisible by 4 7 1
SECTION C
3. Attempt any one part of the following: 10 x 1 = 10
a. Construct a Moore machine which is equivalent to the Mealy machine M given 7 1
below:
SECTION-A
1. Attempt all questions in brief. 2 x 10 = 20
Q no. Question Marks CO
a. Derive the CFG for (a+b)* 2 1
b. Give the formal definition of Moore machine. 2 1
c. Explain Chomsky Hierarchy. 2 2
d. What is regular Expression? Write various applications of regular expression. 2 2
e. Explain pumping lemma for context free language. 2 3
f. Write down the Closure properties of CFL. 2 4
g. Draw the graphical representation for PDA. 2 5
SECTION-B
2. Attempt any three of the following: 10 x 3 = 30
Q no. Question Marks CO
a. i) Design a FA which accepts set of strings containing exactly four 1’s in every 7 1
string over alphabet ∑= {0, 1}
b. ii) Define
Write short Finite Automata (FA).
notes on: 7 2
i) Church’s Thesis
ii) Recursive and Recursive Enumerable Language
c. i) Reduce the following grammar to CNF, S→abSb | a | aAb, A→bS | aAAb . 7 3
ii) Explain Chomasky classification of grammar.
d. Design a PDA for the language L= {WWT | W= (a+b)* } 7 4
e. Construct a turing machine that enumerates {xnynzn | n≥1}. 7 5
SECTION C
3. Attempt any one part of the following: 10 x 1 = 10
a. Construct a DFA equivalent to the NFA 7 1
b. Construct a minimum state automaton equivalent to the DFA given in the picture. 7 1