Construct TM for accepting Even Palindrome

28kviews

written 8.7 years ago by

snehalbailmare • 320

modified 3.9 years ago by

pedsangini276 • 4.8k

Mumbai University > Informatica Technology > Sem 4 > Automata Theory

Marks: 10

Year:May 16

automata theory

ADD COMMENT EDIT

1 Answer

860views

written 8.7 years ago by

snehalbailmare • 320

A Turing Machine (TM) is a mathematical model which consists of an infinite length tape divided into cells on which input is given.

It consists of a head which reads the input tape. A state register stores the state of the Turing machine.

After reading an input symbol, it is …

Create a free account to keep reading this post.

and 2 others joined a min ago.

ADD COMMENT EDIT

Please log in to add an answer.