%0 Conference Proceedings
%T Enhancement of Automata with Jumping Modes
%+ Akita University
%A Fazekas, Szilárd, Zsolt
%A Hoshi, Kaito
%A Yamamura, Akihiro
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 25th International Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA)
%C Guadalajara, Mexico
%Y Alonso Castillo-Ramirez
%Y Pedro P. B. de Oliveira
%I Springer International Publishing
%3 Cellular Automata and Discrete Complex Systems
%V LNCS-11525
%P 62-76
%8 2019-06-26
%D 2019
%R 10.1007/978-3-030-20981-0_5
%K Jumping mode
%K Jumping finite automata
%K Pushdown automata
%K Pumping lemma
%K Context free language
%Z Computer Science [cs]Conference papers
%X 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.
%G English
%Z TC 1
%Z WG 1.5
%2 https://inria.hal.science/hal-02312614/document
%2 https://inria.hal.science/hal-02312614/file/484947_1_En_5_Chapter.pdf
%L hal-02312614
%U https://inria.hal.science/hal-02312614
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC1
%~ IFIP-WG1-5
%~ IFIP-AUTOMATA
%~ IFIP-LNCS-11525