A new discontinuous model of computation called one-way jumping finite automata was defined by H. Chigahara et. al. This model was a restricted version of the model jumping finite automata. These automata read an input symbol-by-symbol and jump only in one direction. A generalized linear one-way jumping finite automaton makes jumps after deleting a substring of an input string and then changes its state. These automata can make sequence of jumps in only one direction on an input string either from left to right or from right to left. We show that newly defined model is powerful than its original counterpart. We define and compare the variants, generalized right linear one-way jumping finite automata and generalized left linear one-way jumping finite automata. We also compare the newly defined models with Chomsky hierarchy. Finally, we explore closure properties of the model.

中文翻译：

---

广义线性单向跳跃有限自动机

H. Chigahara 等人定义了一种新的不连续计算模型，称为单向跳跃有限自动机。阿尔。该模型是模型跳跃有限自动机的受限版本。这些自动机一个一个符号一个符号地读取输入并且只向一个方向跳跃。广义线性单向跳跃有限自动机在删除输入字符串的子字符串后进行跳跃，然后改变其状态。这些自动机只能在输入字符串的一个方向上进行从左到右或从右到左的跳跃序列。我们表明新定义的模型比其原始模型更强大。我们定义并比较了变体，广义右线性单向跳跃有限自动机和广义左线性单向跳跃有限自动机。我们还将新定义的模型与 Chomsky 层次结构进行了比较。最后，