On State-Synchronized Automata Systems

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F16%3APU121561" target="_blank" >RIV/00216305:26230/16:PU121561 - isvavai.cz</a>
Result on the web
<a href="http://www.ejournals.eu/Schedae-Informaticae/2015/Volume-24/art/7023/" target="_blank" >http://www.ejournals.eu/Schedae-Informaticae/2015/Volume-24/art/7023/</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.4467/20838476SI.16.019.4360" target="_blank" >10.4467/20838476SI.16.019.4360</a>

Result language
angličtina
Original language name
On State-Synchronized Automata Systems
Original language description
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.
Czech name
—
Czech description
—

Type
J<sub>SC</sub> - Article in a specialist periodical, which is included in the SCOPUS database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2016
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)