Right-one way jumping finite automata are deterministic devices that process their input in a discontinuous fashion. We generalise these devices to nondeterministic machines. More precisely we study the impact on the computational power of these machines when allowing multiple initial states and/or a nondeterministic transition function including spontaneous or λ-transitions. We show inclusion relations and incomparability results of the induced language families. Since for right-one way jumping devices the use of spontaneous transitions is subject to different natural interpretations, we also study this subject in detail, showing that most interpretations are equivalent to each other and lead to the same language families. Finally we also study inclusion and incomparability results to classical language families and to the families of languages accepted by finite automata with translucent letters.

单向跳跃有限自动机是确定性设备，它们以不连续的方式处理其输入。我们将这些设备推广到非确定性机器。更准确地说，我们研究了当允许多个初始状态和/或包括自发或λ的非确定性转换函数时对这些机器的计算能力的影响-过渡。我们展示了诱导语言家族的包含关系和不可比性结果。由于对于单向跳跃设备，自发转换的使用受到不同的自然解释的影响，我们还详细研究了这个主题，表明大多数解释彼此等价并导致相同的语系。最后，我们还研究了经典语系和带有半透明字母的有限自动机接受的语系的包含性和不可比性结果。