Publication Details

Jumping Finite Automata

MEDUNA Alexander and ZEMEK Petr. Jumping Finite Automata. International Journal of Foundations of Computer Science, vol. 23, no. 7, pp. 1555-1578. ISSN 0129-0541. Available from: http://dx.doi.org/10.1142/S0129054112500244
Czech title
Skákající konečné automaty
Type
journal article
Language
english
Authors
URL
Keywords
modified finite automata, discontinuous tape reading, basic properties, comparison with classical finite automata, perspectives
Abstract
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.
Published
2012
Pages
1555-1578
Journal
International Journal of Foundations of Computer Science, vol. 23, no. 7, ISSN 0129-0541
DOI
BibTeX
@ARTICLE{FITPUB9795,
   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",
   doi = "10.1142/S0129054112500244",
   language = "english",
   url = "https://www.fit.vut.cz/research/publication/9795"
}
Back to top