(2 Hours) (Total Marks: 75: Q.P. Code: 22218

29 CB 712 F47 CD E70 036 41F DB 178 1C3
C 71 F C E 3 41 D 17 1 0
CB B71 2F4 47CDDE7 7036 641 FDB B17 81C C302 21D
7 2F 7C E 03 4 FD 1 81 30 1 29
B7 12F 47 D 70 64 1FD B1 781 C3 21 D2 CB
1 C E 3 1 0 D 9
71 2F4 47C DE7 703 641 FDB B17 781C C30 21D 29C CB7 712F
D
2F 7C E 03 64 FD 1 81 30 21 29 B 12 4
12 47 D 70 6 1F B 78 C3 2 D2 C 71 F 7C
F C E 3 41 D 17 1 0 1D 9 B 2 47 D
F4 47CDDE7 7036 641 FDB B17 81C C302 21D 29C CB7 712F F47 CD E70
7 F 8 C E 3
47 CD E70 0364 41F DB 178 1C3 3021 1D2 29CB B71 12F4 47C DE 703 641
CD E7 36 1F DB 17 1C 02 D 9C 7 2F 7C DE 70 64 FD
7C E 03 41 D 1 81 30 1D 29 B 12 47 D 7 36 1F B
D 70 64 F B 78 C3 21 2 C 71 F4 C E 03 41 D 17
Q. 1
i.
i.
B.
A.
v.
ii.
DE E70 364 1FDDB1 1781 1C3 021 D29 9CB B712 2F4 7CDDE7 7036 641F FDB B17 81C
iv.
3 1 7 8
iii.
7 C 0 D 0 4 3
E7 7036 641F FDB B17 81C 302 21D 29C CB7 712F F47C CDE E70 364 1FDDB1 1781 1C3 021
03 41 D 17 81C 30 1D 29 B7 12 47 D 70 364 1F B 78 C3 02 D2
64 FD B1 81 3 21 29 CB 12 F4 CD E7 36 1F DB 17 1C 02 1D 9C
1F B 78 C 02 D2 C 71 F 7C E 03 41 D 1 81 30 1D 29 B
DB 17 1C 302 1D 9C B7 2F 47C DE 70 64 FD B1 781 C3 21 2 CB 71
17 81C 302 1D 29C B7 12F 47 DE 70 364 1FD B1 781 C3 021 D2 9CB 71 2F4
81 30 1D 29 B 12 47 CD 7 36 1F B 78 C 02 D 9C 7 2F 7C
C3 21 2 CB 71 F4 C E 03 41 D 17 1C 30 1D 29 B7 12 47 D
a) 0*
02 D2 9C 71 2F 7C DE 703 641 FD B1 81 30 21D 29 CB 12 F47 CD E7
automaton.
1D 9C B7 2F 47 D 70 64 FD B1 78 C3 21 2 CB 71 F4 C E 03
c)  + 0
29 B 12 47 CD E70 36 1F B 78 1C3 02 D2 9C 71 2F 7C DE 703 641
CB 71 F4 CD E7 36 41 DB 17 1C 02 1D 9C B7 2F 47 D 70 64 FD
a) null tree
71 2F4 7C E7 03 41 FDB 17 81C 30 1D 29C B7 12F 47 CD E70 364 1F B1
2F 7C DE 03 64 FD 1 81 30 21 29 B 12 4 CD E7 36 1F DB 78
47 D 70 64 1F B 78 C3 21 D2 CB 71 F4 7C E 03 41 D 17 1C
CD E7 36 1F DB 17 1C 02 D 9C 7 2F 7C DE 70 64 FD B1 81 3
c) initial, final
E7 036 41F DB 17 81C 302 1D 29C B7 12F 47C DE 70 364 1FD B1 781 C3 021
c) acyclic graph
a) initial, current
03 41 D 17 81C 30 1D 29 B7 12 47 D 70 364 1F B 78 C3 02 D2
to some ______ state.

c) Mealy machine
a) Moore machine
1F B 78 C 02 D2 C 71 F 7C E 03 41 D 1 81 30 1D 29 B
labelled with input/output.

81 30 1D 29 B 12 47 CD 7 36 1F B 78 C 02 D 9C 7 2F 7C
c) directed edge, vertex

Attempt All the Questions
C3 21 2 CB 71 F4 C E 03 41 D 17 1C 30 1D 29 B7 12 47 D
N.B. 1) All questions are compulsory.
a) undirected edge, vertex

1D 9C B7 2F 47 D 70 64 FD B1 78 C3 21 2 CB 71 F4 C E 03
Choose the correct alternative
29 B 12 47 CD E70 36 1F B 78 1C3 02 D2 9C 71 2F 7C DE 703 641

Empty string () has length ____.

2) Figures to the right indicate marks.
2F 7C DE 03 64 FD 1 81 30 21 29 B 12 4 CD E7 36 1F DB 78
iii. A derivation tree is also called ____

47 D 70 64 1F B 78 C3 21 D2 CB 71 F4 7C E 03 41 D 17 1C
Page 1 of 3
4) Mixing of sub-questions is not allowed.
03 41 D 17 81C 30 1D 29 B7 12 47 D 70 364 1F B 78 C3 02 D2
1F B 78 C 02 D2 C 71 F 7C E 03 41 D 1 81 30 1D 29 B
(2 ½ Hours)
nondeterministic, derivation, deterministic}

________ involves application of productions.

81 30 1D 29 B 12 47 CD 7 36 1F B 78 C 02 D 9C 7 2F 7C
b) 0+
C3 21 2 CB 71 F4 C E 03 41 D 17 1C 30 1D 29 B7 12 47 D
d) DFA
1D 9C B7 2F 47 D 70 64 FD B1 78 C3 21 2 CB 71 F4 C E 03
21D29CB712F47CDE703641FDB1781C30
29 B 12 47 CD E70 36 1F B 78 1C3 02 D2 9C 71 2F 7C DE 703 641
d) 0* + 0+
S0133 / S2002 THEORY OF COMPUTATION.
d) parse tree
Fill in the blanks (Choose correct one from the pool)

2F 7C DE 03 64 FD 1 81 30 21 29 B 12 4 CD E7 36 1F DB 78
d) next, final
b) binary tree
47 D 70 64 1F B 78 C3 21 D2 CB 71 F4 7C E 03 41 D 17 1C
________ is used to show that certain sets are not regular.

b) current, final
_______ provides an ideal theoretical model of a computer.

ii. The set {, 0, 00, 000, …}can also be represented by _____
03 41 D 17 81C 30 1D 29 B7 12 47 D 70 364 1F B 78 C3 02 D2
1F B 78 C 02 D2 C 71 F 7C E 03 41 D 1 81 30 1D 29 B
3) Draw suitable diagrams and illustrations wherever necessary.
b) pushdown automata
d) vertex, directed edge
81 30 1D 29 B 12 47 CD 7 36 1F B 78 C 02 D 9C 7 2F 7C
set of final states, an initial state and a stack called pushdown store.
C3 21 2 CB 71 F4 C E 03 41 D 17 1C 30 1D 29 B7 12 47 D
b) vertex, undirected edge
02 D2 9C 71 2F 7C DE 703 641 FD B1 81 30 21D 29 CB 12 F47 CD

1D 9C B7 2F 47 D 70 64 FD B1 78 C3 21 2 CB 71 F4 C E
29 B 12 47 CD E70 36 1F B 78 1C3 02 D2 9C 71 2F 7C DE 7
CB 71 F4 CD E7 36 41 DB 17 1C 02 1D 9C B7 2F 47 D 70
71 2F4 7C E7 03 41 FDB 17 81C 30 1D 29C B7 12F 47 CD E70
2F 7C DE 03 64 FD 1 81 30 21 29 B 12 4 CD E7 36
47 D 70 64 1F B 78 C3 21 D2 CB 71 F4 7C E 03
A transition graph is a finite directed labelled graph in which each _____
When the moves of the machine cannot be determined uniquely by the input
represents a state and _____ indicate the transition of a state and the edges are
iv. A _______ has a read-only input tape, an input alphabet, a finite state control,
v. The acceptability of a string is decided by the reachability from the ____ state
{one, zero, Turing machine, Arden’s theorem, Pumping Lemma,
symbol and the present state, such an automaton is called _________

CD E7 36 1F DB 17 1C 02 D 9C 7 2F 7C DE 70 64
Q.P. Code: 22218
[Total Marks: 75
E7 036 41F DB 17 81C 302 1D 29C B7 12F 47C DE 70 364

03 41 D 17 81C 30 1D 29 B7 12 47 D 70 364 1
64 FD B1 81 3 21 29 CB 12 F4 CD E7 36 1F
1F B 78 C 02 D2 C 71 F 7C E 03 41
DB 17 1C 302 1D 9C B7 2F 47C DE 70 64 FD
(5M)
(5M)
17 81C 302 1D 29C B7 12F 47 DE 70 364 1FD

81 30 1D 29 B 12 47 CD 7 36 1F B
C3 21 2 CB 71 F4 C E 03 41 D 1
02 D2 9C 71 2F 7C DE 703 641 FD B1
1D 9C B7 2F 47 D 70 64 FD B1 7
29 B 12 47 CD E70 36 1F B 78
C 71 F4 C E 3 41 D 17 1
29 CB 712 F47 CD E70 036 41F DB 178 1C3
C 71 F C E 3 41 D 17 1 0
7 2F 7C E 03 4 FD 1 81 30 1 29
B7 12F 47 D 70 64 1FD B1 781 C3 21 D2 CB
1 C E 3 1 0 D 9
D
2F 7C E 03 64 FD 1 81 30 21 29 B 12 4
12 47 D 70 6 1F B 78 C3 2 D2 C 71 F 7C
F C E 3 41 D 17 1 0 1D 9 B 2 47 D
7 F 8 C E 3
7C E 03 41 D 1 81 30 1D 29 B 12 47 D 7 36 1F B
Q.3
Q.2
D 70 64 F B 78 C3 21 2 C 71 F4 C E 03 41 D 17 C.
3 1 7 C 0 D 7 0 4 8 3
03 41 D 17 81C 30 1D 29 B7 12 47 D 70 364 1F B 78 C3 02 D2
1F B 78 C 02 D2 C 71 F 7C E 03 41 D 1 81 30 1D 29 B
81 30 1D 29 B 12 47 CD 7 36 1F B 78 C 02 D 9C 7 2F 7C
C3 21 2 CB 71 F4 C E 03 41 D 17 1C 30 1D 29 B7 12 47 D
1D 9C B7 2F 47 D 70 64 FD B1 78 C3 21 2 CB 71 F4 C E 03
b. a*+b
Sa
Ua
29 B 12 47 CD E70 36 1F B 78 1C3 02 D2 9C 71 2F 7C DE 703 641
2F 7C DE 03 64 FD 1 81 30 21 29 B 12 4 CD E7 36 1F DB 78
i. Define language.
47 D 70 64 1F B 78 C3 21 D2 CB 71 F4 7C E 03 41 D 17 1C
a. a*b(a+b)*
more a’s than b’s.
iv. What is a sentence?
q3
q2
q1
U  for c do S
P: S  if b then U
03 41 D 17 81C 30 1D 29 B7 12 47 D 70 364 1F B 78 C3 02 D2
q0
state
of 1’s in w is 3 mod 4.
by the following table.
generating all integers.

Present
1F B 78 C 02 D2 C 71 F 7C E 03 41 D 1 81 30 1D 29 B
S  if b then U else S
81 30 1D 29 B 12 47 CD 7 36 1F B 78 C 02 D 9C 7 2F 7C
C3 21 2 CB 71 F4 C E 03 41 D 17 1C 30 1D 29 B7 12 47 D
grammar make it ambiguous?

following regular expressions.

{a, b} containing exactly 2a’s.
1D 9C B7 2F 47 D 70 64 FD B1 78 C3 21 2 CB 71 F4 C E 03
29 B 12 47 CD E70 36 1F B 78 1C3 02 D2 9C 71 2F 7C DE 703 641
q3
q2
q1
q3
a=0
2F 7C DE 03 64 FD 1 81 30 21 29 B 12 4 CD E7 36 1F DB 78
47 D 70 64 1F B 78 C3 21 D2 CB 71 F4 7C E 03 41 D 17 1C
Page 2 of 3
Attempt the following: (Any THREE)

03 41 D 17 81C 30 1D 29 B7 12 47 D 70 364 1F B 78 C3 02 D2
Next State 
q0
q3
q2
1F B 78 C 02 D2 C 71 F 7C E 03 41 D 1 81 30 1D 29 B q1
a=1
81 30 1D 29 B 12 47 CD 7 36 1F B 78 C 02 D 9C 7 2F 7C
A. Define pushdown automata. Explain its design.
D. Show that L= { ap | p is a prime} is not regular.

iii. Compare between Moore and Mealy Machines.
C3 21 2 CB 71 F4 C E 03 41 D 17 1C 30 1D 29 B7 12 47 D
Explain the following terms in one or two lines
F. State and prove Pumping Lemma for regular sets.

1D 9C B7 2F 47 D 70 64 FD B1 78 C3 21 2 CB 71 F4 C E 03
21D29CB712F47CDE703641FDB1781C30
29 B 12 47 CD E70 36 1F B 78 1C3 02 D2 9C 71 2F 7C DE 703 641
A. Define an automaton. Explain its various components.

0
0
1
0
2F 7C DE 03 64 FD 1 81 30 21 29 B 12 4 CD E7 36 1F DB 78
v. When do we say two regular expressions are equivalent?
47 D 70 64 1F B 78 C3 21 D2 CB 71 F4 7C E 03 41 D 17 1C
Output
03 41 D 17 81C 30 1D 29 B7 12 47 D 70 364 1F B 78 C3 02 D2
1F B 78 C 02 D2 C 71 F 7C E 03 41 D 1 81 30 1D 29 B
E. Construct a finite automaton equivalent to (0+1)*(00+11)(0+1)*

81 30 1D 29 B 12 47 CD 7 36 1F B 78 C 02 D 9C 7 2F 7C
C3 21 2 CB 71 F4 C E 03 41 D 17 1C 30 1D 29 B7 12 47 D
B. What is context free grammar? Construct a context free grammar G

1D 9C B7 2F 47 D 70 64 FD B1 78 C3 21 2 CB 71 F4 C E
29 B 12 47 CD E70 36 1F B 78 1C3 02 D2 9C 71 2F 7C DE 7
C. Define ambiguous grammar. Find if the following set of production of a

CB 71 F4 CD E7 36 41 DB 17 1C 02 1D 9C B7 2F 47 D 70
71 2F4 7C E7 03 41 FDB 17 81C 30 1D 29C B7 12F 47 CD E70
D. Construct a grammar G accepting the set L of all strings over {a, b} having
2F 7C DE 03 64 FD 1 81 30 21 29 B 12 4 CD E7 36
C. Construct a DFA accepting all the string w over {0, 1} such that the number
47 D 70 64 1F B 78 C3 21 D2 CB 71 F4 7C E 03
ii. What is the regular expression corresponding to the set of all the strings over
E. Define Regular grammar. Also Generate the transition diagram for the
B. Construct a Mealy Machine which is equivalent to the Moore machine given
CD E7 36 1F DB 17 1C 02 D 9C 7 2F 7C DE 70 64
Q.P. Code: 22218
E7 036 41F DB 17 81C 302 1D 29C B7 12F 47C DE 70 364

03 41 D 17 81C 30 1D 29 B7 12 47 D 70 364 1
64 FD B1 81 3 21 29 CB 12 F4 CD E7 36 1F
1F B 78 C 02 D2 C 71 F 7C E 03 41
DB 17 1C 302 1D 9C B7 2F 47C DE 70 64 FD
(5M)
17 81C 302 1D 29C B7 12F 47 DE 70 364 1FD

(15M)
(15M)
81 30 1D 29 B 12 47 CD 7 36 1F B
C3 21 2 CB 71 F4 C E 03 41 D 1
02 D2 9C 71 2F 7C DE 703 641 FD B1
1D 9C B7 2F 47 D 70 64 FD B1 7
29 B 12 47 CD E70 36 1F B 78
C 71 F4 C E 3 41 D 17 1
29 CB 712 F47 CD E70 036 41F DB 178 1C3
C 71 F C E 3 41 D 17 1 0
7 2F 7C E 03 4 FD 1 81 30 1 29
B7 12F 47 D 70 64 1FD B1 781 C3 21 D2 CB
1 C E 3 1 0 D 9
D
2F 7C E 03 64 FD 1 81 30 21 29 B 12 4
12 47 D 70 6 1F B 78 C3 2 D2 C 71 F 7C
F C E 3 41 D 17 1 0 1D 9 B 2 47 D
7 F 8 C E 3
7C E 03 41 D 1 81 30 1D 29 B 12 47 D 7 36 1F B
D 70 64 F B 78 C3 21 2 C 71 F4 C E 03 41 D 17
Q.4
E.
C.
B.
C.
B.
D.
D.
A.
3 1 7 C 0 D 7 0 4 8 3
03 41 D 17 81C 30 1D 29 B7 12 47 D 70 364 1F B 78 C3 02 D2
1F B 78 C 02 D2 C 71 F 7C E 03 41 D 1 81 30 1D 29 B
81 30 1D 29 B 12 47 CD 7 36 1F B 78 C 02 D 9C 7 2F 7C
C3 21 2 CB 71 F4 C E 03 41 D 17 1C 30 1D 29 B7 12 47 D
1D 9C B7 2F 47 D 70 64 FD B1 78 C3 21 2 CB 71 F4 C E 03
e. ab*a
29 B 12 47 CD E70 36 1F B 78 1C3 02 D2 9C 71 2F 7C DE 703 641
2F 7C DE 03 64 FD 1 81 30 21 29 B 12 4 CD E7 36 1F DB 78
47 D 70 64 1F B 78 C3 21 D2 CB 71 F4 7C E 03 41 D 17 1C
d. a+b(a+b)*
q1
q5
q4
q3
q2
b. (aa)*+(aaa)*
03 41 D 17 81C 30 1D 29 B7 12 47 D 70 364 1F B 78 C3 02 D2
q1
q0
state
Present
states/
1F B 78 C 02 D2 C 71 F 7C E 03 41 D 1 81 30 1D 29 B
81 30 1D 29 B 12 47 CD 7 36 1F B 78 C 02 D 9C 7 2F 7C
C3 21 2 CB 71 F4 C E 03 41 D 17 1C 30 1D 29 B7 12 47 D
c. (1+01+001)*(+0+00)
1D 9C B7 2F 47 D 70 64 FD B1 78 C3 21 2 CB 71 F4 C E 03
a. (a+b)*(aa+bb+ab+ba)*
b
29 B 12 47 CD E70 36 1F B 78 1C3 02 D2 9C 71 2F 7C DE 703 641

Briefly describe Halting problem.

0Lq2
1Lq2
0Rq5
bRq3
q1
q0
2F 7C DE 03 64 FD 1 81 30 21 29 B 12 4 CD E7 36 1F DB 78
47 D 70 64 1F B 78 C3 21 D2 CB 71 F4 7C E 03 41 D 17 1C
E. Write a note on unsolvable problems.

q5 and the transition table given below.
Page 3 of 3
Q.5 Attempt the following: (Any THREE)

03 41 D 17 81C 30 1D 29 B7 12 47 D 70 364 1F B 78 C3 02 D2
*****
1F B 78 C 02 D2 C 71 F 7C E 03 41 D 1 81 30 1D 29 B
Write a note on multitape Turing machines.

0
0Lq2
0Rq4
bRq4
0Rq1
81 30 1D 29 B 12 47 CD 7 36 1F B 78 C 02 D 9C 7 2F 7C
1
C3 21 2 CB 71 F4 C E 03 41 D 17 1C 30 1D 29 B7 12 47 D
q1
Find if the set L= {ww | w{a,b}* is not regular.

q0, q1
A. Construct a deterministic automaton equivalent to
Tape symbol
1D 9C B7 2F 47 D 70 64 FD B1 78 C3 21 2 CB 71 F4 C E 03
21D29CB712F47CDE703641FDB1781C30
29 B 12 47 CD E70 36 1F B 78 1C3 02 D2 9C 71 2F 7C DE 703 641
F. Design a Turing machine that accepts {0n1n | n  1}
Write the computation sequence of the input string 00.

2F 7C DE 03 64 FD 1 81 30 21 29 B 12 4 CD E7 36 1F DB 78
47 D 70 64 1F B 78 C3 21 D2 CB 71 F4 7C E 03 41 D 17 1C
1
1Lq4
1Lq2
bRq5
03 41 D 17 81C 30 1D 29 B7 12 47 D 70 364 1F B 78 C3 02 D2
F. What is derivation tree? Give example to explain the concept.
Describe the characteristics of a linear bound automata model.
1F B 78 C 02 D2 C 71 F 7C E 03 41 D 1 81 30 1D 29 B
81 30 1D 29 B 12 47 CD 7 36 1F B 78 C 02 D 9C 7 2F 7C
Describe the sets represented by the following regular expressions.

What is Turing machine? Explain its composition and its operation.
C3 21 2 CB 71 F4 C E 03 41 D 17 1C 30 1D 29 B7 12 47 D
1D 9C B7 2F 47 D 70 64 FD B1 78 C3 21 2 CB 71 F4 C E
29 B 12 47 CD E70 36 1F B 78 1C3 02 D2 9C 71 2F 7C DE 7
CB 71 F4 CD E7 36 41 DB 17 1C 02 1D 9C B7 2F 47 D 70
What are the ways in which we can represent Turing machines? Explain.
71 2F4 7C E7 03 41 FDB 17 81C 30 1D 29C B7 12F 47 CD E70

2F 7C DE 03 64 FD 1 81 30 21 29 B 12 4 CD E7 36
47 D 70 64 1F B 78 C3 21 D2 CB 71 F4 7C E 03
M=({q0, q1},{0,1},,q0,{q0}) where  is defined by its state table give below.
Consider the Turing machine with five states with initial state q1 and final state
CD E7 36 1F DB 17 1C 02 D 9C 7 2F 7C DE 70 64
Q.P. Code: 22218
E7 036 41F DB 17 81C 302 1D 29C B7 12F 47C DE 70 364

03 41 D 17 81C 30 1D 29 B7 12 47 D 70 364 1
64 FD B1 81 3 21 29 CB 12 F4 CD E7 36 1F
1F B 78 C 02 D2 C 71 F 7C E 03 41
DB 17 1C 302 1D 9C B7 2F 47C DE 70 64 FD
17 81C 302 1D 29C B7 12F 47 DE 70 364 1FD
(15M)
(15M)
81 30 1D 29 B 12 47 CD 7 36 1F B
C3 21 2 CB 71 F4 C E 03 41 D 1
02 D2 9C 71 2F 7C DE 703 641 FD B1
1D 9C B7 2F 47 D 70 64 FD B1 7
29 B 12 47 CD E70 36 1F B 78
C 71 F4 C E 3 41 D 17 1

(2 Hours) (Total Marks: 75: Q.P. Code: 22218

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

(2 Hours) (Total Marks: 75: Q.P. Code: 22218

Uploaded by

Copyright:

Available Formats

29 CB 712 F47 CD E70 036 41F DB 178 1C3

to some ______ state.

labelled with input/output.

c) directed edge, vertex

a) undirected edge, vertex

29 B 12 47 CD E70 36 1F B 78 1C3 02 D2 9C 71 2F 7C DE 703 641

Empty string () has length ____.

iii. A derivation tree is also called ____

DB 17 1C 302 1D 9C B7 2F 47C DE 70 64 FD B1 781 C3 21 2 CB 71

nondeterministic, derivation, deterministic}

________ involves application of productions.

71 2F4 7C E7 03 41 FDB 17 81C 30 1D 29C B7 12F 47 CD E70 364 1F B1

Fill in the blanks (Choose correct one from the pool)

________ is used to show that certain sets are not regular.

_______ provides an ideal theoretical model of a computer.

DB 17 1C 302 1D 9C B7 2F 47C DE 70 64 FD B1 781 C3 21 2 CB 71

02 D2 9C 71 2F 7C DE 703 641 FD B1 81 30 21D 29 CB 12 F47 CD

{one, zero, Turing machine, Arden’s theorem, Pumping Lemma,

symbol and the present state, such an automaton is called _________

E7 036 41F DB 17 81C 302 1D 29C B7 12F 47C DE 70 364

17 81C 302 1D 29C B7 12F 47 DE 70 364 1FD

by the following table.

generating all integers.

grammar make it ambiguous?

following regular expressions.

Attempt the following: (Any THREE)

A. Define pushdown automata. Explain its design.

D. Show that L= { ap | p is a prime} is not regular.

F. State and prove Pumping Lemma for regular sets.

A. Define an automaton. Explain its various components.

71 2F4 7C E7 03 41 FDB 17 81C 30 1D 29C B7 12F 47 CD E70 364 1F B1

E. Construct a finite automaton equivalent to (0+1)*(00+11)(0+1)*

B. What is context free grammar? Construct a context free grammar G

C. Define ambiguous grammar. Find if the following set of production of a

E7 036 41F DB 17 81C 302 1D 29C B7 12F 47C DE 70 364

17 81C 302 1D 29C B7 12F 47 DE 70 364 1FD

29 B 12 47 CD E70 36 1F B 78 1C3 02 D2 9C 71 2F 7C DE 703 641

Briefly describe Halting problem.

E. Write a note on unsolvable problems.

Q.5 Attempt the following: (Any THREE)

Write a note on multitape Turing machines.

Find if the set L= {ww | w{a,b}* is not regular.

Write the computation sequence of the input string 00.

71 2F4 7C E7 03 41 FDB 17 81C 30 1D 29C B7 12F 47 CD E70 364 1F B1

Describe the sets represented by the following regular expressions.

71 2F4 7C E7 03 41 FDB 17 81C 30 1D 29C B7 12F 47 CD E70

E7 036 41F DB 17 81C 302 1D 29C B7 12F 47C DE 70 364

You might also like

E. Construct a finite automaton equivalent to (0+1)(00+11)(0+1)