0 Bewertungen0% fanden dieses Dokument nützlich (0 Abstimmungen)
111 Ansichten1 Seite
FORMAL LANGUAGES AND AUTOMATA THEORY (Computer Science and Engineering) Time: 3 hours Max Marks: 80 Answer any FIVE Questions All Questions carry equal marks.
FORMAL LANGUAGES AND AUTOMATA THEORY (Computer Science and Engineering) Time: 3 hours Max Marks: 80 Answer any FIVE Questions All Questions carry equal marks.
Copyright:
Attribution Non-Commercial (BY-NC)
Verfügbare Formate
Als PDF, TXT herunterladen oder online auf Scribd lesen
FORMAL LANGUAGES AND AUTOMATA THEORY (Computer Science and Engineering) Time: 3 hours Max Marks: 80 Answer any FIVE Questions All Questions carry equal marks.
Copyright:
Attribution Non-Commercial (BY-NC)
Verfügbare Formate
Als PDF, TXT herunterladen oder online auf Scribd lesen
III B.Tech I Semester(R05) Supplementary Examinations, November 2010
FORMAL LANGUAGES AND AUTOMATA THEORY (Computer Science & Engineering) Time: 3 hours Max Marks: 80 Answer any FIVE Questions All Questions carry equal marks ?????
1. Construct DFA over { a, b } for the following: [2×8]
(a) On input ‘w’, produce output an , where n is the number of occurrences of the sub string ab in w. (b) On input ‘w’, produce output an , where n is the number of occurrences of the sub string aba in w. 2. Construct a NFA, which accepts language L=set of strings with zero (or) more number of 0’s followed by zero (or) more number of 1’s followed by zero (or) more number of 2’s And construct equivalent DFA. [16] 3. Consider the two regular expressions r=0*+1*, s=01*10*+1*0+(0*1)* (a) Find a string corresponding to r but not to s. (b) Find a string corresponding to s but not to r. [8+8] 4. Construct Left Linear Grammar and Right Linear grammars for the languages shown below. (a) (0+1)*00(0+1)* (b) (((01+10)*11)*00)*. [2×8] 5. Eliminate useless symbols, useless productions, unit productions. And null productions from the following grammars: (a) S → aS |A| c A→a B → aa C → acb (b) S → aa |A| B| C A → aB |λ B → Aa C → aCD D → ddd. [8+8] 6. (a) Construct the PDA corresponding to the grammar: S→aABB/aAA A→aBB/a B→bBB/A. (b) Construct a PDA that accepts the language L = {wcwR /w ∈ {a, b}∗ }. [8+8] 7. (a) Compare and contrast Finite automation, push down automaton and Turing machines. (b) Design Turing Machine, which multiplies two integers. Give its state transition diagram. [8+8] 8. (a) Give the CSL for L={an bn cn : n >= 1} (b) Writes the properties of recursive and recursive enumerable languages. (c) Mention the properties of DCFL’s. [5+6+5]