Abstract
The recently introduced one-way jumping automata are strictly more powerful than classical finite automata (FA) while maintaining decidability in most of the important cases. We investigate the extension of the new processing mode to two-way deterministic finite automata (2DFA), resulting in deterministic finite automata which can jump to the nearest letter which they can read, with jumps allowed in either direction. We show that two-way jumping automata are strictly more powerful than one-way jumping ones and that alternative extensions of 2DFA with this jumping mode lead to equivalent machines. We also prove that the class of languages accepted by the new model is not closed under the usual language operations. Finally we show how one could change the model to terminate on every input by using non-erasable end markers.
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.
