Abstract

The number of tape reversals required for the recognition of a set of inputs by a 1-tape Turing machine (TM) has been proposed before as a measure of complexi It is shown that if a set is recognizable by a multi-tape TM with no more than R(n) tape reversals, where n is the input length, then the set is recog It is also shown that if a set is recognizable by a multi-tape TM within time T(n) , then the set is recognizable by a 1-tape off-line TM with no more than Upper bounds on the number of reversals necessary for the recognition of a number of well-known classes of languages are also obtained.

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 call

Disclaimer: 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.