Year-end Sale % OFF 
Abstract
Recently, new types of non-sequential machine models have been introduced and studied, such as jumping automata and one-way jumping automata. We study the abilities and limitations of (finite, pushdown and linear bounded) automata with these 2 jumping modes of tape heads with respect to how they affect the class of accepted languages. We provide adapted versions of pumping lemmas and other methods to determine whether a language is accepted by a machine with jumping mode. Using these methods we establish the inclusion or incomparability relationships among the classes of languages defined by the new machines and their classical counterparts. We also study the closure properties of the resulting language classes and show that under most fundamental language operations, these classes are not closed.
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.
