Scribd
Upload
57 views2 pages

Flat Jan 2016

This document contains exam questions on the topics of formal languages and automata theory. It covers concepts such as automata, DFAs, NFAs, regular expressions, context-free grammars, pushdown automata, Turing machines, and the Chomsky hierarchy. The questions require tasks like designing automata to recognize languages, converting between models of computation, proving properties of language classes, and explaining applications and problems in the theory.

Uploaded by

Chempa Tusti
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
57 views2 pages

Flat Jan 2016

This document contains exam questions on the topics of formal languages and automata theory. It covers concepts such as automata, DFAs, NFAs, regular expressions, context-free grammars, pushdown automata, Turing machines, and the Chomsky hierarchy. The questions require tasks like designing automata to recognize languages, converting between models of computation, proving properties of language classes, and explaining applications and problems in the theory.

Uploaded by

Chempa Tusti
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

USN

gscs56

Fifth Semester B.E. Degree Examination, Dec.2015/Jan.2016


Formal Languages & Automata Theory
Timc: 3 hrs. Max. Marks: 100
Note: Answer FIVE.full questions, selecting
at least TWO questiorts.from each part.

PAR-I'_ A
il. What is Automata? Discuss why study autornata. (06 Marks)
b. Mention the differences between DFA. NFA and NFA-e . (04 I\'larks)
c. Dcsign a DFA to acccpt tl-re language L = {W / W is of eve n length and begins with 0l |.
(06 Marks)
d. Design the NFA-e or NFA fbr the languages given below:
i) abc, abd and aacd {Assurne f = a,b,c,d }
ii) {ab, abc}* {Assurne I= a,b,c} (04 Marks)

2 a. Covcrt the following NFA-e to DFA using "subset construction scheme" (08 Marks)
0-t

Fig. Q2 (a)
b. Defrne Regular expressictn and write regular expressiorr fbr the following languages:
i) L-1s2''6:'n:n >0, m)0|
ii) Language over {0, l} having all -l(0+l)
strings not containing 00. (G6 Marks)
Convert the regular expression (0+1) to a NFA-e . (06 N{arks)

a. State ancl prove pumping Lemma theoren'r for regular languages. Show that
L -
{a''b'' I n > 0} is not regular. (08 N{arks}
b. What is Homomorphism? Explain with an example. (04 N{arks)
c. Consider the transition table of DFA given below:

+A B A
B C
C D B
*D D A
E D F
F G E
G F G
H G t)
F'ig. Q3 (c)
i) Draw the table of distinguishabilities of states.
ii) Construct the equivalent minimized DFA. (08 Marks)

I of 2
10cs56
4 a. Obtain a grammar to generate rntegers and write der:ivation for the unsigned integer 1965.
(08 Marks)
b. Clonsider the grammar:
S + aS laSbS le
Is the above gramntar arnbiguous? Sliow that the string aab has t,uvo
-
i) Parse trees
ii) Left niost derivations
iii) Rightmost derivations (12 Marks)

PART _ B
5 a' Detrne PDA. Design PDA to accept the language L(M)= (a*b)-} by a final
{,ocor'' lc,re
state and also give the graphical representation of pDA. (12 Marks)
b. Convert the following CF'G to PDA:
S -+ aABB I aAA
A -+ aBB la
B-+bBBlA
C-+a (08 Nlarks)

6 a. Consider the following grammar:


S + ASts:e
A-+aASla
B -+ SbS lA lbb
i) Are there any useless syrnbols? Eliminate if so.
ii) Eliminate e productions.
iii) Elinrilrate unit productions.
iv) Put the grammar into Chomsky Normal Form. (08 Marks)
b. Show that L: {a''b''c'' ln > 0} is not context free. (04 Marks)
c. Prove that tlre context free latrguages are closed under union, concatenation and reversal.
(08 Marks)

7 a. Design a turing machine that perfonns the following function:


* *
Q,,o) l- q rco,,; for any co e ll |
and also write its transition diagram. (12 Nlarks)
b. Explain the general structure of multitape and nor.r deterministic turing machines. (08 Marks)

8 Write short notes on:


a. Applications of regular expressions.
b. Applications of context fiee Grammars.
o. Post's correspondence problern.
d. Chomsl<y hielarchy. (20 Marks)

*+rr**

2 otL

You might also like