Abstract
This paper investigates closure properties (under row and column catenations, row and column closures, row and column cyclic closures, and projection) of the classes of sets accepted by four-way and three-way tape-bounded two-dimensional Turing machines whose input tapes are not restricted to square ones.
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.
