On Basic Properties of Jumping Finite Automata

TL;DR

This paper completes the foundational study of jumping finite automata by resolving open questions on their closure properties, correcting previous errors, and exploring their relationships with other computational models.

Contribution

It provides the first comprehensive analysis of closure properties, corrects earlier inaccuracies, and links jumping finite automata to related models in formal language theory.

Findings

Closure properties are fully characterized.

Erroneous previous results are corrected.

Relations with other automata models are established.

Abstract

We complete the initial study of jumping finite automata, which was started in a former article of Meduna and Zemek \citep{athMED1}. The open questions about basic closure properties are solved. Besides this, we correct erroneous results presented in the article. Finally, we point out important relations between jumping finite automata and some other models studied in the literature.