Conference paper

 
Čermák, M., Meduna, A.: n-Accepting Restricted Pushdown Automata Systems, In: 13th International Conference on Automata and Formal Languages, Nyíregyháza, HU, MTA SZTAKI, 2011, p. 168-183, ISBN 978-615-5097-19-5
Publication language:english
Original title:n-Accepting Restricted Pushdown Automata Systems
Title (cs):n-Přijímající omezené systémy zásobníkových automatů
Pages:168-183
Proceedings:13th International Conference on Automata and Formal Languages
Conference:13th International Conference on Automata and Formal Languages
Place:Nyíregyháza, HU
Year:2011
ISBN:978-615-5097-19-5
Publisher:Computer and Automation Research Institute, Hungarian Academy of Sciences
Keywords
restricted automata system, n-generation, n-string, n-language, n-acceptance
Annotation
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.
BibTeX:
@INPROCEEDINGS{
   author = {Martin Čermák and Alexander Meduna},
   title = {n-Accepting Restricted Pushdown Automata Systems},
   pages = {168--183},
   booktitle = {13th International Conference on Automata and Formal
	Languages},
   year = {2011},
   location = {Nyíregyháza, HU},
   publisher = {Computer and Automation Research Institute, Hungarian
	Academy of Sciences},
   ISBN = {978-615-5097-19-5},
   language = {english},
   url = {http://www.fit.vutbr.cz/research/view_pub.php?id=9563}
}