Abstract
The purpose of this paper is to propose a new type acceptor called the “two-dimensional on-line tessellation acceptor” (denoted by “2-ota”) and to examine several properties of the 2-ota. The 2-ota might be considered as a real-time mode of rectangular array bounded cellular space, introduced by Smith and Beyer. First, several fundamental properties (e.g., closure properties) of the 2-ota are examined. Then, the accepting power of the 2-ota is compared with that of the two-dimensional finite automaton, introduced by Blum and Hewitt. The main results are 1. 1. The class of sets accepted by nondeterministic 2-ota's contains properly that of sets accepted by nondeterministic two-dimensional finite automata; 2. 2. The class of sets accepted by deterministic 2-ota's is incomparable with that of sets accepted by deterministic (or nondeterministic) two-dimensional finite automata.
Sign-in/Register to access full text options 
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.
