TY - JOUR
TI - On State-Synchronized Automata Systems
AU - Meduna, Alexander
AU - Kučera, Jiřĭ
TI - On State-Synchronized Automata Systems
AB - 
	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.
VL - 2015
IS - Volume 24
PY - 2016
SN - 1732-3916
C1 - 2083-8476
SP - 221
EP - 237
DO - 10.4467/20838476SI.16.019.4360
UR - https://ejournals.eu/en/journal/schedae-informaticae/article/on-state-synchronized-automata-systems
KW - state-synchronized automata systems
KW - automata systems
KW - pushdown automata
KW - determinism
KW - recursively enumerable languages