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 automata with these two jumping modes of tape heads with respect to how they affect the class of accepted languages. We give several methods to determine whether a language is accepted by a machine with jumping mode. We also consider relationships among the classes of languages defined by the new machines and their classical counterparts.
CITATION STYLE
Fazekas, S. Z., Hoshi, K., & Yamamura, A. (2019). Enhancement of automata with jumping modes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11525 LNCS, pp. 62–76). Springer Verlag. https://doi.org/10.1007/978-3-030-20981-0_5
Mendeley helps you to discover research relevant for your work.