Journal article

MEDUNA Alexander and ZEMEK Petr. Jumping Finite Automata. International Journal of Foundations of Computer Science. 2012, vol. 23, no. 7, pp. 1555-1578. ISSN 0129-0541. Available from:
Publication language:english
Original title:Jumping Finite Automata
Title (cs):Skákající konečné automaty
Journal:International Journal of Foundations of Computer Science, Vol. 23, No. 7, SG
modified finite automata, discontinuous tape reading, basic properties, comparison with classical finite automata, perspectives
The present paper proposes a new investigation area in automata theory: jumping finite automata. These automata work like classical finite automata except that they read input words discontinuously; that is, after reading a symbol, they can jump over some symbols within the words and continue their computation from there. The paper establishes several results concerning jumping finite automata in terms of commonly investigated areas of automata theory, such as decidability and closure properties. Most importantly, it achieves several results that demonstrate differences between jumping finite automata and classical finite automata. In its conclusion, the paper formulates several open problems and suggests future investigation areas.
   author = {Alexander Meduna and Petr Zemek},
   title = {Jumping Finite Automata},
   pages = {1555--1578},
   journal = {International Journal of Foundations of Computer Science},
   volume = {23},
   number = {7},
   year = {2012},
   ISSN = {0129-0541},
   language = {english},
   url = {}

Your IPv4 address:
Switch to IPv6 connection

DNSSEC [dnssec]