| Institute of Informatics>>> Acta Cybernetica>>> Past Issues>>> Volume 19, Number 2, 2009>>> |
 Magyarul
|
On Pure Multi-Pushdown Automata that Perform Complete Pushdown Pops
Tomás Masopust and Alexander Meduna
Abstract (in LaTeX format)
This paper introduces and discusses pure multi-pushdown automata that remove symbols from their pushdowns only by performing complete pushdown pops. This means that during a pop operation, the entire pushdown is compared with a prefix of the input, and if they match, the whole contents of the pushdown is erased and the input is advanced by the prefix. The paper proves that these automata define an infinite hierarchy of language families identical with the infinite hierarchy of language families resulting from right linear simple matrix grammars. In addition, this paper discusses some other extensions of these automata with respect to operations they can perform with their pushdowns. More specifically, it discusses pure multi-pushdown automata that perform complete pushdown pops that are allowed to join two pushdowns and/or create a new pushdown.
Kewords: pure multi-pushdown automaton, complete pushdown pop, infinite hierarchy.
Full text
Available electronic editions: PDF.
Note that full text is available only for papers that are at least 3 years old. For more recent papers only the first page of the paper is provided.
BibTeX entry
@article{Masopust:2009:ActaCybernetica,author = {Tom\'{a}\v{s} Masopust and Alexander Meduna},
title = {On Pure Multi-Pushdown Automata that Perform Complete Pushdown Pops},
journal = {Acta Cybernetica},
volume = {19},
number= {2},
pages = {537--552},
year = {2009},
abstract = {This paper introduces and discusses pure multi-pushdown automata that remove symbols from their pushdowns only by performing complete pushdown pops. This means that during a pop operation, the entire pushdown is compared with a prefix of the input, and if they match, the whole contents of the pushdown is erased and the input is advanced by the prefix. The paper proves that these automata define an infinite hierarchy of language families identical with the infinite hierarchy of language families resulting from right linear simple matrix grammars. In addition, this paper discusses some other extensions of these automata with respect to operations they can perform with their pushdowns. More specifically, it discusses pure multi-pushdown automata that perform complete pushdown pops that are allowed to join two pushdowns and/or create a new pushdown.},
keywords = {pure multi-pushdown automaton, complete pushdown pop, infinite hierarchy}
}