Publication Details

n-Accepting Restricted Pushdown Automata Systems

ČERMÁK, M.; MEDUNA, A. n-Accepting Restricted Pushdown Automata Systems. 13th International Conference on Automata and Formal Languages. Nyíregyháza: Computer and Automation Research Institute, Hungarian Academy of Sciences, 2011. p. 168-183. ISBN: 978-615-5097-19-5.
Czech title
n-Přijímající omezené systémy zásobníkových automatů
Type
conference paper
Language
English
Authors
Čermák Martin, Ing., Ph.D.
Meduna Alexandr, prof. RNDr., CSc. (DIFS)
Keywords

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

Abstract

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.

Published
2011
Pages
168–183
Proceedings
13th International Conference on Automata and Formal Languages
ISBN
978-615-5097-19-5
Publisher
Computer and Automation Research Institute, Hungarian Academy of Sciences
Place
Nyíregyháza
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"
}
Back to top