Scribd
Upload
44 views2 pages

11028/N M.Sc. II Semester Examination, April/May 2005 Paper I (2.1)

1. The document contains questions from a past exam paper on Automata, Language and Computation. 2. The questions cover topics like deterministic finite automata (DFA), regular expressions, pushdown automata (PDA), Turing machines, pumping lemma for regular languages, grammars and Chomsky normal form. 3. Students are required to construct DFAs and convert between different grammars, determine whether strings are generated by given grammars, and design Turing machines to accept specific languages.

Uploaded by

gopi9966957145
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
44 views2 pages

11028/N M.Sc. II Semester Examination, April/May 2005 Paper I (2.1)

1. The document contains questions from a past exam paper on Automata, Language and Computation. 2. The questions cover topics like deterministic finite automata (DFA), regular expressions, pushdown automata (PDA), Turing machines, pumping lemma for regular languages, grammars and Chomsky normal form. 3. Students are required to construct DFAs and convert between different grammars, determine whether strings are generated by given grammars, and design Turing machines to accept specific languages.

Uploaded by

gopi9966957145
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

.. , ,.;.["!

1-, I
L ....
AbRO.~.,\.b;:.t"-Dd
d 1 .~c, .••·,,;LLg ~.'-
Chikkadpcdly
.' ~ t·· r;'r:' -1 ijY;::;':;<J.p.~f
r·'. , .••..•. ' ~ _ . No.: 11028/N
FACULTY OF SCIENCE
M.Sc. II Semester Examination, April/May 2005
COMPUTER SCIENCE
Paper I (2.1)
(Automata Language and Computation)
Time : 3 Hours] [Max. Marks: 100
Section A - (Marks: 8 x 5 = 40)
Answer all the questions.
1. Write about Deterministic Finite Automata.
2. Define regular expression.
3. Define Moore Machine.
4. State Pumping Lemma for Reg~llar sets.
5. Write short notes on Push down automata.
6. Find the Left most and the Right most derivation of the string aabbaa of the grammar.
S~aAS/a
A ~ S b A/SS/ba.
7. State Church's hypothesis and eA'}Jlain.
8. Write about Turing Machine as computing of functions.
Section B - (Marks: 4 x 15 = 60)
Answer all the questions.
9. (a) Construct OFA M' equivalent to NFA M given as follows:
M = (Q. I. 8, q o . F). where'
I
Q = {q0' q I'I = {G. I}, r= {qI }and
8 (qO' 0) = {q 0' q}I' 8 (q0 . 1) = {qI }, 8 (q I . 0) = <».

8 (q I . 1) = {q 0' q}.I
Or
(b) Find the regular expression of the Language accepted by OFA M whose transition
diagram is given below:

Start

[p.T.O.
2 11028/N

10. (a) Find the FA M' with minimum states equivalent to FA M whose transition
diagram is given below: 0

Or
(b) State and explain Myhill-Nerode theorem.
)
11. (a) Convert the grammar G = ( { S, A. B }, { a, b }, p, S ) that has P the set of
following productions.
S~ bAlaB.
A~ bAAlasla
B~aBB/bs/b
into equivalent grammar in Chomsky; Nannal Form.
Or
(b) Find whether the string baaba generated by the grammar or not.
S~AB/BC
A~BAla
B~ CC/b
C~AB/a
Where the terminals are a and b.

12. (a) Design a Turing machine that accepts the Language {OIl III I n ~ 1 }.
Or
(b) Write about Chomsky hierarchy by specifying the form of productions of
the grammar generating the languages and the machine accepting the
languages.

You might also like