answersLogoWhite

0

as turing machine acts as a recognizer, acceptor , generator

the applications are:

1)storage in finate control (eg:-string with alternate symbols)

2)multiple tracks (eg:-to check prime no. or not)

3)checking of symbols(eb:- palindromes checking)

User Avatar

Wiki User

7y ago

What else can I help you with?

Related Questions

What are types of turing machine?

multiple trackshift over turing machinenon deterministictwo way turing machinemultitape turing machineoffline turing machinemultidimensional turing machinecomposite turing machineuniversal turing machine


In what year was the Turing machine invented?

The Turing machine was invented in 1936 by British mathematician Alan Turing.


What is the difference between a Turing machine and a universal Turing machine?

A Turing machine is a machine that can perform any possible computation, and emulate any real world computer, except other Turing machines. A Universal Turing machine however, is a theoretical machine that could even emulate Turing Machines. In actuallity they're both the same, since if you fed the tape from a Turing machine into another Turing machine, the second would in essence be emulating the first. Its also useful to note that Turing machines aren't really "machines" per se, but actually models of the process of computation itself.


What did Alan turing do to help with computers?

the turing machine


What is principle of the Universal Turing Machine?

One Turing machine, with fixed set of transitions, which can simulate any Turing machine, including itself, and thus can compute anything computable


What is offline turing machine?

offline turing machine is like standard turing machine which imlemented by adding a control unit(temp storage)and seperate input tape..


What was the name of Alan turing's machine?

The machine developed by Alan Turing was called the Turing Machine. It was a theoretical computing device that laid the groundwork for modern computers and the concept of algorithmic computation.


Importance of Turing machine?

The Turing machine is the theoretical underpinning of all modern computing devices. The Turing machine is not a physically constructed device, but a way of conceptualizing computer algorithms. See link.


Is the language recognized by a co-Turing-recognizable machine?

Yes, the language is recognized by a co-Turing-recognizable machine.


Can you construct a Turing machine that accepts the language defined by the keyword?

A Turing machine can be built to accept the language defined by the keyword.


How to do turing machine factorial?

4


Can you provide examples of Turing machine state diagrams?

Turing machine state diagrams are visual representations of the transitions between states in a Turing machine. They typically consist of circles representing states and arrows indicating the transitions between them. An example of a Turing machine state diagram could be one that shows the transitions between states for a machine that adds 1 to a binary number.