6: Turing machine
Abstract
This chapter describes a general model of computing, called Turing machine. Turing machine is used as a computational function. This chapter demonstrates various ways in which Turing machine can be used. The chapter covers a mathematical description of the machine, Turing machine as a language acceptor, and a representation of Turing machine. It is represented as a transition table and as a transition diagram. Turing machines are designed here for the class of languages called the recursively enumerable languages. We also present in this text the instantaneous description of the string. Chapter also covers types of Turing machines including multitape, multitrack, and universal Turing machines.
Keywords
Turing machine; Computing; ...
Get Automata Theory and Formal Languages now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
