The effect of jumping modes on various automata models.

Autor: Fazekas, Szilárd Zsolt, Hoshi, Kaito, Yamamura, Akihiro
Předmět:
Zdroj: Natural Computing; Mar2022, Vol. 21 Issue 1, p17-30, 14p
Abstrakt: 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. [ABSTRACT FROM AUTHOR]
Databáze: Complementary Index
Externí odkaz: