Scribd
Upload
187 views2 pages

Mca 2 Sem Introduction To Automata Theory and Languages Rca 203 2016 17

This document contains an exam for an Introduction to Automata Theory and Languages course. It has three sections: Section A contains short answer questions defining concepts like DFAs, Mealy machines, context-free grammars, regular grammars, and pushdown automata. Section B contains longer questions involving constructing machines and grammars, including a Mealy machine, minimum state automaton, and language generated by a context-free grammar. Section C contains two essay questions, one showing the halting problem of Turing machines is undecidable and another reducing a grammar to Chomsky Normal Form.

Uploaded by

compiler&automata
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
187 views2 pages

Mca 2 Sem Introduction To Automata Theory and Languages Rca 203 2016 17

This document contains an exam for an Introduction to Automata Theory and Languages course. It has three sections: Section A contains short answer questions defining concepts like DFAs, Mealy machines, context-free grammars, regular grammars, and pushdown automata. Section B contains longer questions involving constructing machines and grammars, including a Mealy machine, minimum state automaton, and language generated by a context-free grammar. Section C contains two essay questions, one showing the halting problem of Turing machines is undecidable and another reducing a grammar to Chomsky Normal Form.

Uploaded by

compiler&automata
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

www.aktuonline.

com

Printed Pagm : 2 RoII No. RCA203

MCA
THEORY EXAMTNATTON (SEM-rr) 2016-17
INTRODUCTION TO AUTOMATA TIIEORY & LANGUAGES
Time : 3 Hoilrs Max, lllarlrs : 70
Note : Be precise in youF onswer,
SECTION: A
Atternpt all questions. 7x2=14
a) Define DFA using diagram.
b) Define rnealy machitle.
c) Define context free grammar with an exarnple.
d) Define regular grammar with an example.
e) Define Push down Autornata.
f) What are the special features of Turing machine {TM)?
g) Define Post Correspondence Problem?
SECTION.B
Attempt any five questions. 5x7=$$
(a) Construct a Mealy Machine to equivalent Moore machine which is given below -
www.aktuonline.com

Next State
Present lnput a = 0 Input a = I
State State Output State Output
aQt Qt t Qz 0
4z Q+ I Q* 1

Qs Qz t Qt 1

Q+ Qs
0 4t 1

(b) Construct a minimum state automation equivalent to a given automation M whose


&ansition table is given below:

Qo Qa Qe

Qt Qz Qs

Qz Qs Q+

Qz Qo 4s
Q* Qo Qd
cls 4t Q+
tlt Qs

(c)If 6 = ( {5}, {0,1}, {S -+ 051/01} , 5 ), find the lenguage gonerated by G.


(d) Give the Chomsky Hierarchy of grammars specifically giving form of production rules in
each class of grammar.
(e) State and proof Arden's theorem ?
(f) State and proof pumping lemma for regular set.
G) Show that the language { e
1' 2" / n>- I } is not a context free language .

www.aktuonline.com
www.aktuonline.com

(h)showthatthecont€xtnee$ammarGgrvenbyproduction s -) sBs/8 , B -) b, is
ambiguous.

SECTION.C
Attempt any two questions. Each question corry r0.5 marks
2x10.s=2r
3. Show that the halting problem of Turing Machine is undecideble

4. Reduce the following gfiunmar G to CNF


GisS + aAD,A + aBlbAB, B - b,D + d,

L = { wwR / w is in (0+1)* and uI represents reverse w. }


www.aktuonline.com

www.aktuonline.com 'rL {

You might also like