Abstract
The goal of this work is to investigate the computational power of nondeterminism and Las Vegas randomization for two-dimensional finite automata. The following three results are the main contribution of this paper: (i) Las Vegas (three-way) two-dimensional finite automata are more powerful than (three-way) two-dimensional deterministic ones. (ii) Three-way two-dimensional nondeterministic finite automata are more powerful than three-way two-dimensional Las Vegas finite automata. (iii) There is a strong hierarchy based on the number of computations (as measure of the degree of nondeterminism) for three-way two-dimensional finite automata. These results contrast with the situation for one-way and two-way finite automata, where all these computation modes have the same acceptance power, and the differences may occur only in the sizes of automata. Results (i) and (ii) provide the first such simultaneous acceptance separation between nondeterminism, Las Vegas, and determinism for a computing model.
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.
