Result Details
On Double-Jumping Finite Automata and Their Closure Properties
Křivka Zbyněk, Ing., Ph.D., DIFS (FIT)
Meduna Alexandr, prof. RNDr., CSc., DIFS (FIT)
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.
discontinuous and parallel tape reading, general jumping finite automata, even-length languages, left and right jumps
@article{BUT155797,
author="Radim {Kocman} and Zbyněk {Křivka} and Alexandr {Meduna}",
title="On Double-Jumping Finite Automata and Their Closure Properties",
journal="RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS",
year="2018",
volume="52",
number="2",
pages="185--199",
doi="10.1051/ita/2018013",
issn="0988-3754",
url="https://www.rairo-ita.org/articles/ita/abs/2018/02/ita180059/ita180059.html"
}Nástroje, metody a technologie ICT pro podporu konceptu smart cities, BUT, Vnitřní projekty VUT, FIT-S-17-3964, start: 2017-03-01, end: 2020-02-29, completed
V3C - Visual Computing Competence Center, TAČR, Centra kompetence, TE01020415, start: 2012-05-01, end: 2019-12-31, completed