Result Details
On Parallel Versions of Jumping Finite Automata
The present paper proposes a new investigation area in automata theory -- n-parallel jumping finite automata. These automata further extend recently presented jumping finite automata that are focused on discontinuous reading. The proposed modification uses multiple reading heads that work in parallel and can discontinuously read from the input in several places at once. We also define the more restricted version of these automata which only allows jumping to the right. This restricted version is then further studied, compared with n-parallel right linear grammars, and several of its properties are derived.
jumping finite automata, n-parallel right linear grammars, discontinuous tape reading, parallel tape reading
@inproceedings{BUT119917,
author="Radim {Kocman} and Alexandr {Meduna}",
title="On Parallel Versions of Jumping Finite Automata",
booktitle="Proceedings of the 2015 Federated Conference on Software Development and Object Technologies",
year="2016",
series="Advances in Intelligent Systems and Computing",
volume="511",
pages="142--149",
publisher="Springer International Publishing",
address="Cham",
doi="10.1007/978-3-319-46535-7\{_}12",
isbn="978-3-319-46534-0",
url="http://link.springer.com/chapter/10.1007/978-3-319-46535-7_12"
}V3C - Visual Computing Competence Center, TAČR, Centra kompetence, TE01020415, start: 2012-05-01, end: 2019-12-31, completed
Výzkum pokročilých metod ICT a jejich aplikace, BUT, Vnitřní projekty VUT, FIT-S-14-2299, start: 2014-01-01, end: 2016-12-31, completed