Abstract
Multitape Turing machines which can use their storage tapes only as counters or as pushdown stores are investigated. The memory access restrictions are produced by regarding the machines as small computers (as in the formalism of Wang) and by restricting the instruction repertoires. Relationships are given linking machines which only accept or reject inputs and machines which emit output sequences as a function of their input. It is shown that without restrictions on computing time or amount of tape used that only six distinct classes of sets of strings (languages) are produced by the above memory access restrictions.
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.
