ČERMÁK Martin and MEDUNA Alexander. nAccepting Restricted Pushdown Automata Systems. 7th Doctoral Workshop on Mathematical and Engineering Methods in Computer Science. Brno: Masaryk University, 2011. ISBN 9788021443051. 
Publication language:  english 

Original title:  nAccepting Restricted Pushdown Automata Systems 

Title (cs):  nPřijímající omezené systémy zásobníkových automatů 

Pages:  1 

Book:  7th Doctoral Workshop on Mathematical and Engineering Methods in Computer Science 

Conference:  MEMICS'11  7th Doctoral Workshop on Mathematical and Engineering Methods in Computer Science 

Place:  Brno, CZ 

Year:  2011 

ISBN:  9788021443051 

Publisher:  Masaryk University 

Keywords 

pushdown automaton, automata system, computation control, multilanguage, nlanguage 
Annotation 

Abstract of the same name paper presented on AFL 2011.

Abstract 

This presentation deal with naccepting pushdown automata systems,
consisting of n components represented by pushdown automata. These
systems accept nlanguages, consisting of nstrings. The presentation
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. The presentation demonstrates that both
types of these restricted systems are equally powerful in the sense that
an nlanguage is accepted by one version if and only if the same
nlanguage is accepted by the other.
