n-Accepting Restricted Pushdown Automata Systems

pushdown automaton, automata system, computation control, multilanguage, n-language

Abstract of the same name paper presented on AFL 2011.

This presentation deal with n-accepting pushdown automata systems, consisting of n components represented by pushdown automata. These systems accept n-languages, consisting of n-strings.  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 n-language is accepted by one version if and only if the same n-language is accepted by the other.