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.

最近，已经引入并研究了新型的非顺序机器模型，例如跳跃自动机和单向跳跃自动机。我们研究了磁带头的这两种跳跃模式的（有限，下推和线性有界）自动机的能力和局限性，它们如何影响可接受的语言类别。我们提供抽水词条和其他方法的改编版本，以确定具有跳跃模式的机器是否接受某种语言。使用这些方法，我们在新机器及其经典对应机器所定义的语言类别之间建立了包含或不可比关系。我们还研究了所得语言类的闭包属性，并表明在大多数基本语言操作下，这些类不是封闭的。