Abstract
The existence of a substantial gap between deterministic and nondeterministic two-way automata is one of the most famous open problems in automata theory. This problem is also related to the fundamental DLOG vs. NLOG question. An exponential gap between the number of states of two-way nondeterministic automata (2NFAS) and their deterministic counterparts (2DFAS) has been proved only for some restrictions of 2DFAS up to now. It seems that the hardness of this problem lies in the fact that, when trying to prove lower bounds, we must consider every possible automaton, without imposing any particular structure or meaning to the states, while when designing a specific automaton, we always assign an unambiguous interpretation to the states. In an attempt to capture the concept of meaning of states, a new model of two-way automata, namely reasonable automaton (RA), was introduced in [6]. In a RA, each state is associated with a logical formula expressing some properties of the input word, and transitions are designed to maintain consistency within this setting. In this paper we extend the study, started in [6], of the descriptional complexity of RAS solving the liveness problem, showing several lower and upper bounds with respect to the logic used for describing the meaning of the individual states.
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 callMore From: International Journal of Foundations of Computer Science
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.
