This action might not be possible to undo. Are you sure you want to continue?

Set No. 1

III B.Tech I Semester Regular Examinations, November 2007 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 NFAs for the following languages (a) The set of strings over alphabet {0,1,.........,9} such that the ﬁnal digit has appeared before. (b) The set of strings over alphabet {0,1,........,9} such that the ﬁnal digit has not appeared before. (c) The set of strings of 0’s and 1’s such that there are two 0’s separated by a number of positions that is a multiple of 4. Note that 0 is an allowable multiple of 4. [4+4+8] 2. For the following NFA with ∈ -moves convert it in to an NFA with out ∈ -moves and show that NFA with ∈-moves accepts the same language as shown in ﬁgure 2. [16]

Figure 2 3. Find a Regular expression corresponding to each of the following subsets over {0,1}*. (a) The set of all strings containing no three consecutive 0’s. (b) The set of all strings where the 10th symbol from right end is a 1. (c) The set of all strings over {0,1} having even number of 0’s & odd number of 1’s. (d) The set of all strings over {0,1} in which the number of occurrences of is divisible by 3. [4×4] 4. (a) Obtain a CFG to generate unequal number of a’s and b’s. (b) Obtain a CFG to obtain balanced set of parentheses.(i.e every left parentheses should match with the corresponding right parentheses). [2×8]

1 of 2

Code No: R05310501 5. (a) Simplify the grammar = { {S,A, B, C, E }, {a,b,c}, P, S } Where, P is S → AB A→a B→b B→C E→ c/∧

Set No. 1

(b) Prove that the following language is not context-free language L = {www |w ∈ {a, b}∗ } is not context free. 6. (a) Construct the PDA for the following grammar. S→AA/a A→SA/b (b) Design a PDA for the following grammar. S→0A A→0AB/1 B→1.

[8+8]

[8+8]

7. Deﬁne Turing machine formally; explain how Turing machine can be used to compute integer functions. Design the Turing machine to compute following function, Show its transition diagram also f(x,y)=xy where x and y are positive integers represented in unary. [16] 8. Give LR(0) items for the grammar S→aAB, A→aAb/ab, B→aB/a. Find its equivalent DFA. Check the parsing by taking a suitable string. [16] ⋆⋆⋆⋆⋆

2 of 2

Code No: R05310501

Set No. 2

III B.Tech I Semester Regular Examinations, November 2007 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 NFAs for the following languages (a) The set of strings over alphabet {0,1,.........,9} such that the ﬁnal digit has appeared before. (b) The set of strings over alphabet {0,1,........,9} such that the ﬁnal digit has not appeared before. (c) The set of strings of 0’s and 1’s such that there are two 0’s separated by a number of positions that is a multiple of 4. Note that 0 is an allowable multiple of 4. [4+4+8] 2. Construct DFA for given (ﬁgure 2) NFA with ∈-moves. [16]

Figure 2 3. Construct a DFA accepting language represented by 0*1*2*. 4. (a) Obtain regular grammar for the following FA as shown in ﬁgure 4a. [16]

Figure 4a (b) What is the language accepted by above FA? 5. (a) What do you mean by Greibach Normal Form (GNF). (b) When is a CFG said to be in GNF? 1 of 2

[2×8]

Code No: R05310501 (c) Convert the following grammar into GNF : S→AB A→BS/b B→SA/a.

Set No. 2

[5+5+6]

6. (a) Find the PDA with only one state that accepts the language {am bn : n > m } (b) Construct the PDA that recognizes the languages L={x=×R : x∈{a,b}+ }. [8+8] 7. Design a T.M for copying of information from one place to the other place. Assume all the necessary. Assumptions. Give Example of the working of your T.M. [16] 8. (a) Find whether the post correspondence problem P={(10,101),(011,11),(101,011)} has a match. Give the solution. (b) Explain Turing reducibility machines. (c) Show that if L and L? are recursively enumerable, and then L is recursive. [6+5+5] ⋆⋆⋆⋆⋆

2 of 2

Code No: R05310501

Set No. 3

III B.Tech I Semester Regular Examinations, November 2007 FORMAL LANGUAGES AND AUTOMATA THEORY (Computer Science & Engineering) Time: 3 hours Max Marks: 80 Answer any FIVE Questions All Questions carry equal marks ⋆⋆⋆⋆⋆ 1. (a) Design a DFA that accepts the set{an }U {b/n ≥ 1} (b) Draw the transition diagram for below FA. M= { {A,B,C,D}, {0,1}, δ,C, {A,C} } δ (A,0) = δ (A,1) = {A,B,C} δ(B,0) = B, δ(B,1) = { A, C } δ (C,0) = {B,C}, δ(C,1) ={ B, D } δ (D,0) = { A, B, C, D } δ(D,1) = {A}. 2. (a) Shown in ﬁgure 2a

[10+6]

Figure 2a Convert the above to its equivalent DFA? (b) Describe the language accepted by automata as shown in ﬁgure 2b. [8+8]

Figure 2b 3. Find a Regular expression corresponding to each of the following subsets over {0,1}*.

1 of 2

Code No: R05310501

Set No. 3

(a) The set of all strings containing no three consecutive 0’s. (b) The set of all strings where the 10th symbol from right end is a 1. (c) The set of all strings over {0,1} having even number of 0’s & odd number of 1’s. (d) The set of all strings over {0,1} in which the number of occurrences of is divisible by 3. [4×4] 4. (a) Obtain a CFG to generate unequal number of a’s and b’s. (b) Obtain a CFG to obtain balanced set of parentheses.(i.e every left parentheses should match with the corresponding right parentheses). [2×8] 5. (a) Reduce the Grammar G given by S→aAa A→Sb/bcc/DaA C→abb/DD E→ac D→aDA into an equivalent grammar by removing useless symbols and useless productions from it. (b) Convert the following grammar into CNF. S→aAD A→aB/bAB B→b D→d.

[8+8]

6. (a) Let G be the grammar given by S→aABB/aAA, A→aBB/a, B→bBB/A Construct the PDA that accepts the language generated by this grammar G. (b) Deﬁne Deterministic pushdown automata. Explain with an example. 7. Give a Turing machine for the following: (a) That computes ones complement of a binary number (b) That shifts the input string, over the alphabet (0,1) by one position right by inserting ‘#′ as the ﬁrst character. [8+8] 8. What are NP-complete and NP-hard problems? Explain them with examples.[16] ⋆⋆⋆⋆⋆ [8+8]

2 of 2

Code No: R05310501

Set No. 4

III B.Tech I Semester Regular Examinations, November 2007 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 for the following: (a) L={w/w has both an even number of 0’s and even number of 1’s } (b) L= { w/w is in the form of ‘x01y’ for some strings x and y consisting of 0’s and 1’s}. 2. (a) Design a Moore Machine to determine the residue mod 4 for each binary string treated as integer. (b) Design a Mealy machine that uses its state to remember the last symbol read and emits output ‘y’ whenever current input matches to previous one, and emits n otherwise. [8+8] 3. Find Regular Expression for the following NFA’s. (a) Figure 3a [2×8] [2×8]

Figure 3a (b) Figure 3b

Figure 3b 4. (a) Obtain a regular grammar to obtain the set of all strings not containing three consecutive 0’ s. (b) Obtain a CFG to generate the set of all strings over alphabet {a ,b} with exactly twice as many a’s as b’s. [2×8] 1 of 2

Code No: R05310501

Set No. 4

5. (a) Deﬁne the context free grammars in the 4 tuple form. (V, T, P, S) for the given languages on Σ (a, b). i. All strings having atleast two ‘a’s. ii. All possible strings not containing triple ‘b’s. (b) Find the context free grammar with no useless symbols equivalent to S→AB/Ca, B→BC/AB, A→a, C→aB/b. (c) State in English about the language corresponding to below given grammar S→aB/bA, A→a/aS/bAA , B→b/bS/aBB. [8+5+3] 6. (a) Find the CFG corresponding to PDA whose transition mapping is as follows: δ(S,a,×)=(s,A×) δ(S,b,A)=(s,AA) δ(S,a,A)=(s, ∧). (b) Let G be a CFG that generates the set of palindromes given by S→aSa/bSb/a/b Find the PDA that accepts L(G). 7. (a) What are the types of T.M’s explain in brief; (b) Explain the importance of Turing machine concept. [8+8]

[8+8]

8. (a) Explain about Deterministic context free language and Deterministic PDA. (b) Show that L={an bn cn : n >= 1} is a CSL. ⋆⋆⋆⋆⋆ [8+8]

2 of 2

Sign up to vote on this title

UsefulNot useful- Flat
- Lecture25,26
- finite automata
- System Programming
- Perl Has Quite an Array of Arithmetic Operators. All of These Work on Variables That Contain
- MELJUN CORTES Automata Lecture Equivalence of Pda and Cfg Part 1 2
- Lesson5 Objects_Strings
- error.txt
- CSC108_Final_2011F
- Algebra Applied to the Multimodeling of Fire Protection Systems
- 2011 Introduction to theory of computation
- c++strings.pptx
- creating_action_sequences
- ROMERO_NYDIA_DISEÑO_IMPLEMENTACION_SIMULADOR_ANEXOS.pdf
- ch03
- Part 2 - Syntax
- MIT6_045JS11_lec02
- ascript3
- New Microsoft Office Word Document
- php_mysql Training
- Post Script Quick Reference
- Experiment No. 4
- Chap16
- cd
- Pre Requirements for Using CRAM Utility
- CLch4
- 3 Tier Architecture
- Functtion in Base Sas and Proc SQL
- JS1-1
- Lecture 16
- JNTU old question papers 2007

Are you sure?

This action might not be possible to undo. Are you sure you want to continue?

We've moved you to where you read on your other device.

Get the full title to continue

Get the full title to continue reading from where you left off, or restart the preview.