Detail publikace

On State-Synchronized Automata Systems

Originální název

On State-Synchronized Automata Systems

Anglický název

On State-Synchronized Automata Systems

Jazyk

en

Originální abstrakt

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.

Anglický abstrakt

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.

BibTex


@article{BUT130905,
  author="Jiří {Kučera} and Alexandr {Meduna}",
  title="On State-Synchronized Automata Systems",
  annote="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.",
  address="NEUVEDEN",
  chapter="130905",
  doi="10.4467/20838476SI.16.019.4360",
  edition="NEUVEDEN",
  howpublished="online",
  institution="NEUVEDEN",
  number="24",
  volume="2015",
  year="2016",
  month="may",
  pages="221--237",
  publisher="NEUVEDEN",
  type="journal article in Scopus"
}