@article{a4c9b049-f78f-410f-8e5f-9b76509bed9d,
author = {Alexander Meduna, Jiřĭ Kučera},
title = {On State-Synchronized Automata Systems},
journal = {Schedae Informaticae},
volume = {2015},
number = {Volume 24},
year = {2016},
issn = {1732-3916},
pages = {221-237},keywords = {state-synchronized automata systems; automata systems; pushdown automata; determinism; recursively enumerable languages},
abstract = {In this paper, we introduce a new kind of automata systems, called state-synchronized automata systems of degree n. In general, they consists of n pushdown automata, referred to as their components. These systems can perform a computation step provided that the concatenation of the current states of all their components belongs to a prescribed control language. As its main result, the paper demonstrates that these systems characterize the family of recursively enumerable languages. In fact, this characterization is demostrated in both deterministic and nondeterministic versions of these systems. Restricting their components, these systems provides less computational power.},
doi = {10.4467/20838476SI.16.019.4360},
url = {https://ejournals.eu/en/journal/schedae-informaticae/article/on-state-synchronized-automata-systems}
}