r05310501 Formal Languages and Automata Theory

www.andhracolleges.
com The Complete Information About Colleges in Andhra Pradesh
Code No: R05310501 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
⋆⋆⋆⋆⋆
www.andhracolleges.com
1. Construct NFAs for the following languages
(a) The set of strings over alphabet {0,1,.........,9} such that the final digit has
appeared before.
(b) The set of strings over alphabet {0,1,........,9} such that the final 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 figure 2.
[16]
{0,1}*.
Figure 2
3. Find a Regular expression corresponding to each of the following subsets over
(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]
Seminar Topics - Scholarships - Admission/Entrance Exam Notifications

1 ofUSA-UK-Australia-Germany-France-NewZealand
2 Universities List
www.andhracolleges.com Engineering-MBA-MCA-Medical-Pharmacy-B.Ed-Law Colleges Information

www.andhracolleges.com The Complete Information About Colleges in Andhra Pradesh

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/∧
(b) Prove that the following language is not context-free language
L = {www |w ∈ {a, b}∗ } is not context free. [8+8]
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]
7. Define Turing machine formally; explain how Turing machine can be used to com-
pute 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 equiv-
alent DFA. Check the parsing by taking a suitable string. [16]
⋆⋆⋆⋆⋆
2 Universities List


⋆⋆⋆⋆⋆
1. Construct NFAs for the following languages
(a) The set of strings over alphabet {0,1,.........,9} such that the final digit has
appeared before.
(b) The set of strings over alphabet {0,1,........,9} such that the final 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 (figure 2) NFA with ∈-moves. [16]
www.andhracolleges.com 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 figure 4a.
[16]
Figure 4a
(b) What is the language accepted by above FA? [2×8]
5. (a) What do you mean by Greibach Normal Form (GNF).

(b) When is a CFG said to be in GNF?
2 Universities List


(c) Convert the following grammar into GNF :
S→AB
A→BS/b
B→SA/a. [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 Universities List


⋆⋆⋆⋆⋆
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 figure 2a

[10+6]
www.andhracolleges.com Figure 2a
Convert the above to its equivalent DFA?
(b) Describe the language accepted by automata as shown in figure 2b. [8+8]
Figure 2b
3. Find a Regular expression corresponding to each of the following subsets over
{0,1}*.
2 Universities List


(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 produc-
tions 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) Define Deterministic pushdown automata. Explain with an example. [8+8]
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 first character. [8+8]
8. What are NP-complete and NP-hard problems? Explain them with examples.[16]
⋆⋆⋆⋆⋆

2 Universities List


⋆⋆⋆⋆⋆
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
[2×8]
emits n otherwise. [8+8]
3. Find Regular Expression for the following NFA’s. [2×8]
(a) Figure 3a
(b) Figure 3b
Figure 3a
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]
2 Universities List


5. (a) Define 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). [8+8]
7. (a) What are the types of T.M’s explain in brief;

(b) Explain the importance of Turing machine concept. [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 Universities List

r05310501 Formal Languages and Automata Theory

Загружено:

Сведения о документе

Исходное описание:

Авторское право

Доступные форматы

Поделиться этим документом

Поделиться или встроить документ

Параметры публикации

Этот документ был вам полезен?

Это неприемлемый материал?

Авторское право:

Доступные форматы

r05310501 Formal Languages and Automata Theory

Загружено:

Авторское право:

Доступные форматы

www.andhracolleges.

com The Complete Information About Colleges in Andhra Pradesh

Code No: R05310501 Set No. 1

(a) The set of all strings containing no three consecutive 0’s.

4. (a) Obtain a CFG to generate unequal number of a’s and b’s.

Seminar Topics - Scholarships - Admission/Entrance Exam Notifications

www.andhracolleges.com Engineering-MBA-MCA-Medical-Pharmacy-B.Ed-Law Colleges Information

Code No: R05310501 Set No. 1

6. (a) Construct the PDA for the following grammar.

www.andhracolleges.com Engineering-MBA-MCA-Medical-Pharmacy-B.Ed-Law Colleges Information

Code No: R05310501 Set No. 2

2. Construct DFA for given (figure 2) NFA with ∈-moves. [16]

5. (a) What do you mean by Greibach Normal Form (GNF).

www.andhracolleges.com Engineering-MBA-MCA-Medical-Pharmacy-B.Ed-Law Colleges Information

Code No: R05310501 Set No. 2

8. (a) Find whether the post correspondence problem P={(10,101),(011,11),(101,011)}

www.andhracolleges.com Engineering-MBA-MCA-Medical-Pharmacy-B.Ed-Law Colleges Information

Code No: R05310501 Set No. 3

2. (a) Shown in figure 2a

www.andhracolleges.com Engineering-MBA-MCA-Medical-Pharmacy-B.Ed-Law Colleges Information

Code No: R05310501 Set No. 3

5. (a) Reduce the Grammar G given by S→aAa

6. (a) Let G be the grammar given by

7. Give a Turing machine for the following:

(a) That computes ones complement of a binary number

Seminar Topics - Scholarships - Admission/Entrance Exam Notifications

www.andhracolleges.com Engineering-MBA-MCA-Medical-Pharmacy-B.Ed-Law Colleges Information

Code No: R05310501 Set No. 4

emits n otherwise. [8+8]

3. Find Regular Expression for the following NFA’s. [2×8]

www.andhracolleges.com Engineering-MBA-MCA-Medical-Pharmacy-B.Ed-Law Colleges Information

Code No: R05310501 Set No. 4

7. (a) What are the types of T.M’s explain in brief;

www.andhracolleges.com Engineering-MBA-MCA-Medical-Pharmacy-B.Ed-Law Colleges Information

Вам также может понравиться