Model) computers, we must restrict the storage capacity of Turing machines."į.D.Lewis is a professor worked in computer science area. Thus any actual computation done on a computer is not as extensiveĪs that which could be completed on a Turing machine. They do not have unending amounts of storage like Turing Here is the motivation for the design of this class of machines. They haveīecome important in the theory of computation even though they have notĮmerged in applications to the extent which pushdown automata enjoy. ![]() "Linear bounded automata were originally developed as models forĪctual computers rather than models for the computational process. This places in doubt the following quote from the notes of F. Recursive undecidability is, of course, a topic in computability theory. ![]() The observation was that the equivalence problem for these automata is recursively undecidable." As Myhill points out, the definition of a linear bounded automaton was motivated by an observation made by Rabin and Scott about two-way finite automata with erasing. ![]() "Linear bounded automata were first defined and investigated by John Myhill in 1960. 7, Providence, RI: American Mathematical Society, 1974, R. Hunt, III, p.2, in "Complexity of Computation", SIAM-AMS Proceedings, Vol. From "The LBA Problem And Its Importance In The Theory of Computation", by J.
0 Comments
Leave a Reply. |