Detail publikace

n-Accepting Restricted Pushdown Automata Systems

ČERMÁK, M. MEDUNA, A.

Originální název

n-Accepting Restricted Pushdown Automata Systems

Anglický název

n-Accepting Restricted Pushdown Automata Systems

Jazyk

en

Originální abstrakt

This paper deals with n-accepting pushdown automata systems, consisting of n components represented by pushdown automata. These systems accept n-languages, consisting of n-strings.  The paper discusses two restricted versions of these systems.  During each step of the accepting process, one version prescribes the components that simultaneously work while the other determines which transition rule can be used in each component.

Anglický abstrakt

This paper deals with n-accepting pushdown automata systems, consisting of n components represented by pushdown automata. These systems accept n-languages, consisting of n-strings.  The paper discusses two restricted versions of these systems.  During each step of the accepting process, one version prescribes the components that simultaneously work while the other determines which transition rule can be used in each component.

Dokumenty

BibTex 


@inproceedings{BUT76312,
  author="Martin {Čermák} and Alexandr {Meduna}",
  title="n-Accepting Restricted Pushdown Automata Systems",
  annote="This paper deals with n-accepting pushdown automata systems, consisting of
n components represented by pushdown automata. These systems accept n-languages,
consisting of n-strings.  The paper discusses two restricted versions of these
systems.  During each step of the accepting process, one version prescribes the
components that simultaneously work while the other determines which transition
rule can be used in each component.",
  address="Computer and Automation Research Institute, Hungarian Academy of Sciences",
  booktitle="13th International Conference on Automata and Formal Languages",
  chapter="76312",
  edition="NEUVEDEN",
  howpublished="print",
  institution="Computer and Automation Research Institute, Hungarian Academy of Sciences",
  year="2011",
  month="august",
  pages="168--183",
  publisher="Computer and Automation Research Institute, Hungarian Academy of Sciences",
  type="conference paper"
}