PL EN


Preferences help
enabled [disable] Abstract
Number of results
2015 | 24 |
Article title

On State-Synchronized Automata Systems

Content
Title variants
Languages of publication
PL
Abstracts
PL
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.
Publisher
Year
Volume
24
Physical description
Dates
published
2015
online
06 - 07 - 2016
Contributors
References
Document Type
Publication order reference
Identifiers
YADDA identifier
bwmeta1.element.ojs-issn-2083-8476-year-2015-volume-24-article-6347
JavaScript is turned off in your web browser. Turn it on to take full advantage of this site, then refresh the page.