1. DEFINITION TURING MACHINE . ANSWER LINK +
2. REPRESENTATION OF TURING MACHINE. ANSWER LINK
3. MOVES OF TURING MACHINE USING ID. ANSWER LINK +
4. INPUT PROCESSING USING ID. ANSWER LINK
5. DESIGN OF TURING MACHINES -
I ) Design a Turing machine to recognize all stlings consisting of an even number
of 1's. ANSWER LINK +
II ) Design a Turing machine over {I. b} which can compute a concatenation
function over L = {I}. If a pair of words (W1,W2) is the input. the output has
to be W1.W2. ANSWER LINK
III ) Design a TM that accepts {0N1N: n >=1}. ANSWER LINK
IV ) Design a Turing machine M to recognize the language 1N2N3N :N>=1
V) Construct a TM that accepts the language 0 1* + 1 0*.
VI) Design a TM which can multiply two positive integers.
VII) NONDETERMINISTIC TURING MACHINES .
No comments:
Post a Comment