Přístupnostní navigace
E-application
Search Search Close
Publication result detail
ČERMÁK, M.; MEDUNA, A.
Original Title
n-Accepting Restricted Pushdown Automata Systems
English Title
Type
Paper in proceedings outside WoS and Scopus
Original 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.
English abstract
Keywords
restricted automata system, n-generation, n-string, n-language, n-acceptance
Key words in English
Authors
RIV year
2012
Released
17.08.2011
Publisher
Computer and Automation Research Institute, Hungarian Academy of Sciences
Location
Nyíregyháza
ISBN
978-615-5097-19-5
Book
13th International Conference on Automata and Formal Languages
Pages from
168
Pages to
183
Pages count
15
Full text in the Digital Library
http://hdl.handle.net/
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" }