Abstract
A study is made of the classes of predicates accepted by three types of multitape Turing machine. In order of decreasing acceptance powers, these are the general Turing machine, the linear-bounded automaton, and the two-way multitape nonwriting automaton. Each class is shown to consist of all and only those predicates which can be defined by a corresponding class of predicate calculus formulas based on catenation, and involving as logical operators conjunction, disjunction, and a type of transitive closure on predicates of 2 n variables.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
