Abstract
A two-dimensional on-line tessellation acceptor is a two-dimensional array of identical finite automata, each connected to its four nearest neighbors. Each symbol of the input is placed on one automaton. The computation starts at the top-left corner of the input and a transition “wave” passes once diagonally across the array. In each cell the new state is computed from the symbol of the input placed in the cell and from the new states of northern and western neighbors. After m + n − 1 steps the input is accepted or rejected depending on the new state entered at the bottom-right corner of the input. In this paper it is shown that the class of languages accepted by nondeterministic two-dimensional on-line tessellation acceptors is not closed under complement. Also the relations between languages accepted by two-dimensional on-line tessellation acceptors and finite automata are considered.
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.
