Detail publikace

n-Accepting Restricted Pushdown Automata Systems

ČERMÁK, M. MEDUNA, A.

Originální název

n-Accepting Restricted Pushdown Automata Systems

Typ

článek ve sborníku mimo WoS a Scopus

Jazyk

angličtina

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.

Klíčová slova

restricted automata system, n-generation, n-string, n-language, n-acceptance

Autoři

ČERMÁK, M.; MEDUNA, A.

Rok RIV

2011

Vydáno

17. 8. 2011

Nakladatel

Computer and Automation Research Institute, Hungarian Academy of Sciences

Místo

Nyíregyháza

ISBN

978-615-5097-19-5

Kniha

13th International Conference on Automata and Formal Languages

Strany od

168

Strany do

183

Strany počet

15

BibTex

@inproceedings{BUT76312,
  author="Martin {Čermák} and Alexandr {Meduna}",
  title="n-Accepting Restricted Pushdown Automata Systems",
  booktitle="13th International Conference on Automata and Formal Languages",
  year="2011",
  pages="168--183",
  publisher="Computer and Automation Research Institute, Hungarian Academy of Sciences",
  address="Nyíregyháza",
  isbn="978-615-5097-19-5"
}