B.

Tech EXAMINATION
Subject: THEORY OF AUTOMATA AND FORMAL LANGUAGES Code: NCS-402
[Time: 3 Hours] [Total Marks: 100]
SECTION-A
Q.1 Attempt all parts. All parts carry equal marks. Write answer of each part in short. (2 x
10=20)
(a) State the equivalence theorem of NFA and DFA.
(b) Design a FA that accepts the odd number of 1s and any number of 0s.
(c) Write Regular Expression for the language that has the set of all strings of 0s and 1s with at
most one pair of consecutive 1s.
(d) Suppose H is the homomorphism from the alphabets {0,1,2} to the alphabets a,b} defined by
h(0)=a h(1)=ab h(2)=ba. What is h(0120) and h(21120)?
(e) Let G be the grammar S->aB/bA,A->a/aS/bAA,B->b/bS/aBB. Derive the string aaabbabbba
using the left most derivation.
(f) State the pumping lemma theorem for CFL.
(g) Define instantaneous description of a PDA.
(h) Define the language generated by a PDA using the two methods of accepting a language.
(i) What is the role of checking off symbols in a Turing Machine?
j) When a problem is said to be undecidable? Give an example of an decidable problem.
SECTION-B
Note: Attempt any 5 questions from this section.
(10 x 5=50)
Q.2 Prove that if L is accepted by a NFA with transitions, then L is accepted by an NFA
without transitions.
Q.3 Construct a DFA for the regular expression aa*/bb*.
Q.4 Obtain the regular expression denoting the language accepted by the following DFA

Q.5 Show that the set L={O

n2/n

is an integer,n>=1} is not regular.

n m n
Q.6 Construct a PDA accepting {a b a /m,n>=1} by empty stack. Also construct the
corresponding context-free grammar accepting the same set.
Q.7 Given G=({S,A},{a,b},P,S) where P={S->AaS|S|SS,A->SbA|ba}
S-Start symbol. Find the left most and right most derivation of the string w=aabbaaa.
Also construct the derivation tree for the string w.
Q.8 Prove that if L is N(M1) for some PDA M1 then L is L(M2 ) for some PDA M2.
Q.9 What are useless symbols in a grammar? Give examples.

SECTION-C
Note: Attempt any 2 questions from this section.
Q.10 Minimize the DFA using Myhill-Nerode Theorem.

(15 x 2=30)

Q. 11 i) Define the language Ld.Show that Ld is neither recursive nor recursively enumerable. (8)
ii) Define Turing machine for computing f(m,n)=m-n ( proper subtraction).
(7)
Q.12 i) Convert the grammar S->AB, A->BS/b, B->SA/a into Greibach NormalForm.

(8)

ii) Find a grammar in Chomsky Normal form equivalent to S->aAD;A->aB/bAB; B->b, D->d. (7)
NOTE- IN SECTION B & C YOU CAN MAKE SUB DIVISION (A,B,C.) MAXIMUM 3 .