n-Accepting Restricted Pushdown Automata Systems
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F11%3APU96016" target="_blank" >RIV/00216305:26230/11:PU96016 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
n-Accepting Restricted Pushdown Automata Systems
Original language description
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.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/MEB041003" target="_blank" >MEB041003: Context-free languages and pushdown automata</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)<br>S - Specificky vyzkum na vysokych skolach
Others
Publication year
2011
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
13th International Conference on Automata and Formal Languages
ISBN
978-615-5097-19-5
ISSN
—
e-ISSN
—
Number of pages
15
Pages from-to
168-183
Publisher name
Computer and Automation Research Institute, Hungarian Academy of Sciences
Place of publication
Nyíregyháza
Event location
Debrecen
Event date
Aug 17, 2011
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—