RAIRO-Theor. Inf. Appl.
Volume 52, Number 2-3-4, April–December 2018
8th Workshop on Non-classical Models of Automata and Applications (NCMA 2016)
|Page(s)||185 - 199|
|Published online||17 January 2019|
On double-jumping finite automata and their closure properties
Centre of Excellence IT4Innovations, Faculty of Information Technology, Brno University of Technology,
Brno, Czech Republic.
* Corresponding author: email@example.com
The present paper modifies and studies jumping finite automata so they always perform two simultaneous jumps according to the same rule. For either of the two simultaneous jumps, it considers three natural directions – (1) to the left, (2) to the right, and (3) in either direction. According to this jumping-direction three-part classification, the paper investigates the mutual relation between the language families resulting from jumping finite automata performing the jumps in these ways and the families of regular, linear, context-free, and context-sensitive languages. It demonstrates that most of these language families are pairwise incomparable. In addition, many closure and non-closure properties of the resulting language families are established.
Mathematics Subject Classification: 68Q45 / 68Q70
Key words: Discontinuous and parallel tape reading / general jumping finite automata / even-length languages / left and right jumps
© EDP Sciences, 2019
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.