<br>

2015 (Automata Theory)

Answer Q. No. 1
and any four from the rcst.
1. Answer any five questions 5x2

(a) Define DFA.

(b) What is Mealy machine ?
(c) State Arden's theorem.
(d) Explain derivation tree with an example.
(e) Define CNF.
() Explain with example ambiguous grammar.
(g)What is unit production ?.
(h) Define context free grammer.

c/16/BCA/5th Seme.(N)/3104 (Turn Over)

<br>

12

(h) Define GNF.

2. (a) Construct a DFA equivalent to an NDFA whose :

transition table is defined in the following table

State b
Q2, 43
91 93
42
43

to
(b) Construct a mininum state automation equivalent
the DFA described in the following diagram
1

7+8

a b°c
3. (a) Find a grammer generating |n 21,
j20.
over
(b) Construct a gramner G accepting all string
{a, b} containing an unequal number at a's and
b's.
8+7

(Continued)
c/17/BCA/5h Seme.(N)/3104(Sup.)
<br>

13

4. (a) Construct DFA equivalent to regular expression

(0+1)" (00 + 11) (0 + 1).
(b) Show that L= {0' 1{i21) is not regular. 8+7

5. (a) Find a reduced grammer equivalent to the grammer

or whose productions are
S AB/CA, B BC/ AB, A a
and Ca B/b.
(b) Criven a content free gramner with production
S AB, A a,BC,CD Db.
Eliminate the
unit production of obtain an equivalent grammer.
8+7

6. (a) Reduce the following grammer G into .CNF where

productions of G are S aAD, AaB/ bAB,
Bb, Dd.
(b) Design a turning machine that accepts
7+8

7. (a) .Construct a grammer a generating L where L is a set

of all palindromes over {a, b}.

(b) Construct the finite automata that accepts the

:
following expression
R =
a. (a + b)". ab.
<br>

2016 (Automata Theory)

Answer Q.
No. 1
and any four from the rest.
1. Answer any five questions :

5x2
(a) Define NFA.
(b) What is Moore Machine ?
(c) State Anden's theorem.
(d) What is Null production ?
(e) Define content sensitive grammer.
{0)
Explain ambiguous grammer with an example.
(g) What is recursive set ?

C/17/BCA/5th Seme.(N)/3104{Sup.)
(Turn Over)
<br>

12

2. (a) Construct a Mealy Machine which is equivalent to the

Moore machine given in the following table 7
Present State Next State Outpiut

43 41
91 91 42
92 93
93 43
(b) Construct the minimum state automaton equivalent
to the following transition diagram : 8

b
b
44

a
b
b

47
b

3. (a) Construct a DFA equivalent to an NDFA whose

transition table is given below : 7
State
42
41 91 43
42 93 92
43
(b) Construct a DFA accepting all strings over (a, b}
ending in ab. 8

C/16/BCA/5h Seme.(N)/3104 (Continued)

<br>

13

4. (a) Let L be the set of all palindromes over fa, b}.

Construct a grammar G generating L. 7

(b) Find a grammar generating L =

fa" bPc|nz1, i20}.

5. (a) Construct a DFA with reduced states equivalent to the

:
regular expression
10 + (0 + 11)0 * 1. 10

is a prime} is not regular. 5

=
(b) Show that L (a|P

6. (a) Consider the NFA given by following diagram :

7

Find the equivalent NFA without €- transition.

(b} Given a CFG with production :

B C
C D
D b
Eliminating the unit production of obtain an
equivalent grammer. 8

C/16/BCA/5 Seme.(N)/3104 (Turn Over)

<br>

14

7. (a) Construct the finite Automaton which accepts the

:
following expression 8
R = +
a.(a b)".b.b.

(b) Change the following grammar into CNF :

7
S
1A/OB
A lAA/0S/0
B OBB/1
<br>

2017 13

(Automata Theory )
Answer any five questions :

1. (a) Explain Arden's Theorem. By using this theorem

construct a regular expression corresponding to the
atuomata given below: 2+5
:

(b} Convert the following DFA into a regular expression

using state climination. Be sure to show intermediate
steps of the proccss, 7

2. (a) Reduce the following grammar to GNE

S AO, A OB, B OA, B1 5

.
c/18/BCA/5 Seme./3104
<br>

14

(b) The set L=a'b2*where i,j,k integer and ij,k 1}. Is L

regular ? Justify your answer. 5

(c) Write the CFG for the language

3. (a) Prove that CFLS are not closed under intersection and
complernent operation.

(b) Show that is not regular.

(c) Show that transition diagram of a finite state

automation that accepts all strings over {0, 1}
(i) having odd number of 0's
(ii) having even number of 0's and even number of
1's. 2+2
4. (a) Design an NPDA for accepting the language
L-wwR: W e (a.b)"
7

(b) Construct the minimum state automata equivalent to

given automata M defined below. 7

C/18/BCA/5h Seme./3104 (Continued)

<br>

15

State

42 46
*g2 2 |To
44 45
2
46
6 G4 6

422
"g final state.
5. (a) Construct a Arecognizing the following Grammar

S as / bA |b

A
aA / bs
/a.
(b) State and explain Arden's theorem with a suitable
example. 7

6. (a) With the help of Schematic diagram explain the

function of DFA, What are the reasons to say it is
deterministic 5+2

(b) Construct left linear and right linear grammar for the
regular expression (0/1j*00(0/1). 7

c/18/BCA/5 Seme. /3 104 (Turn Over)

<br>

16

7. (a) Convert the following grammar to CNF.

SbA | aB
A- +bAA/as fa
BaBB /bs fb

(b) Discuss different language and their corresponding

machine. 8+6
8, (a) Define push down automata obtain PDA to accept all
strings generated by the language

(b) Find the equivalent CFG with no useless symbols.

ABC / BaB
B bBb| a
A aA/BaC/ aaa 8+6
CCA| AC

9. Write short notes (any two): 2x7

(a) PCP

(b) LR(k) granmar

(c) Universal Tuning m/c
(d) Church's hypothesis

C/18/BCA/5-h Seme./3104 (Continued)

<br>

2018 Automota Theory

Answer any five questions 5x14

1, (a) Convert the Mealy machine into Moore machine.

Present State Input =0 Input =1
Next State Output| Next State Output
1

1
0
Q3 1 0 Q4
1 1
Q4

c/19/BCA/5th Sem/3 1 04 (Turn Over)

<br>

16

(b) Minimize the following machine by determining the set

of equivalent states.
Present State Input ) input s 1

Nešt State Output Next State Output

A E 1

B C A
B G
D G A

E F 1 B 0
E 1 D
G D G

H F B

(c) Prove that CFLS are not closed under intersection and
complement operation. 4+5+5

2. (a) Prove that the grammar (S}, {a), {S S+S|S*S|a}, S)

is ambiguous.

(b) Remove the unit production from the following grammar :

S AB|aC, A a. BC|b, C D,D E,E a

C/19/BCA/5th Sen/3 104 (Continued)
<br>

17

(c) What do you mean by inverse machine? Write the

definition of lossless machine. 5+5+(2+2)

3. (a) Construct a regular granmar G generating the regular

set represented by: Pa*ba+b}*.

(b) Design an FAwhich accepts all strings hating 010or

110as substring over S-{0,1).

(c) Show that L faP p is prime} is not regular. 4+3+7

4, (a) Convert the following grammar into its equivalent| CNF.

abAB| aAA a, B
A
$ aAbB, bBaA |bBB|b

(b} Find the regular expression coresponding to the folowing FA:

0
1

7+7

C/19/BCA/5th Sem/3104 (run Gver!

<br>

18

5. (a) Design a PDA which accepts L= (We (a, b)* | W has equal
mumbers of a's and b's.}

(b) Consider the Turing machine given below. Draw the

computation sequence of the input string 00.

Pesent State Tape Symbol

b 1

Q1 1LQ2 ORQ1

bRQ3 OLQ2 1LQ2

Q3 bRg4 Brqs

Q4 ORQ5 ORQ4 1RQ4

OLQ2 7+7

6. (a) Find the Context Free Grammar for the following

language L=a"b" :n1, m>=0.

(b) Construct an equivalent PDA for the following CFG.

SaAB/ bBA

C/19/BCA/Sth Sem/3104 (Continued)

<br>

19

A bS /a

B aS/b

Check if the string abbaaabbbab is accepted by the PDA

or not. 7+7

7. (a) [Link] Kleene Closure and Positive Closure? Give

examples for both.

(b) Convert the following grammar into GNF.

S ABb\a, A -aaA |B, BbAb.

(c) List some identities of regular expression. (2+2)+7+3

8. Write short notes (any two):

(a) Chomsky's classification of grammar ;

(b) Linear bounded automation;

(c) Top down parsingi

(Turn Over)
(d) Decidable language.
<br>

(Automata )

2019
Answer any five questions
1. (a) Convert the Moore Machine into Mealy
Machine:
Present State Next State Output
a= 0
a=1

42
.42 43 0
1
43

(b) Construct a DFAacceptingall strings w over

(0, 1? such that the number of 1's in w is 3
mod 4.

BCAVS/ELEC-LV3104/19 (Continued)
<br>

( 17 )

(c) Construct a DFA accepting all strings over

{a, b} ending in ab. 5+4+ 5

2. (a) Show that G is an LR(0)grammar where G

be the grammar S aA, AAbbjb.

(6) Write the closure properties of languages.

(c) Show that

SaAb,
A CAcc
isnot LR(k) for any natural numberK.
4 +6 + 4
3. (a) Prove that the grammar
({s), {a}, (s s+ ss * sla}, s)
is ambiguous.

(6) Design anFA which accepts all strings

having 010 or 110 as substring over
E{0, 1}.
(c) Show that
L= {aPp is prime} is not regular
4+3 +7
BCAVSELEC-V3 104/19 ( Turn Qver )
<br>

( 18 )

4. (a) Construct a regular grammar accepting

L={wea, b} *|wis a string over{a, b} such
that the number of b's is 3 mod 4}.

(b) Let L be the set of all palindromes over

fa, b}.Construct a grammar Ggenerating L.
(c) Construct a grammar G generating
{a"b'c x> l}. 3+4 +7
|

5. (a) Construct an equivalent PDA for the

following CFG
S -
AbSla
aAB| bBA

B
aSb
Check if the string abbaaabbbab is accepted
by the PDA or not.

(5) Construct a Turing machine that can perform

recursion. 7+ 7

6. (a) Show that

a
L={aip is prime}
is not a context free language.

BCAVSELEC-U3104/19 (Continued)
<br>

( 19 )

(6) If G consists of the production

S aSabSblaSb\bSajA,
show that L(G) is a regular set.

(c) Reduce the following grammar to CNF:

S-ASAbA,
A - B}S,

B C 3+4 +7
7. (a) Write a short note on Universal Turing
Machine.

(b) What are the limitations of Mealy machine

and Moore machine ?

(c) Distinguish between Deterministic and

Non-deterministic FSM's. 6+4+4
8. Write short notes on (any two) :
7x2
(i) Chomsky'sclassification of grammar
(ii) Turing Machine
(iii) Push-down stack and memory machine
"(iv) Context free grammar.