Detail publikace

On Pure Multi-Pushdown Automata that Perform Complete Pushdown Pops

MASOPUST, T. MEDUNA, A.

Originální název

On Pure Multi-Pushdown Automata that Perform Complete Pushdown Pops

Typ

článek v časopise - ostatní, Jost

Jazyk

angličtina

Originální abstrakt

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.

Klíčová slova

Pure multi-pushdown automaton, complete pushdown pop, infinite hierarchy.

Autoři

MASOPUST, T.; MEDUNA, A.

Rok RIV

2009

Vydáno

15. 12. 2009

ISSN

0324-721X

Periodikum

Acta Cybernetica

Ročník

19

Číslo

2

Stát

Spojené státy americké

Strany od

537

Strany do

552

Strany počet

16

BibTex

@article{BUT49617,
  author="Tomáš {Masopust} and Alexandr {Meduna}",
  title="On Pure Multi-Pushdown Automata that Perform Complete Pushdown Pops",
  journal="Acta Cybernetica",
  year="2009",
  volume="19",
  number="2",
  pages="537--552",
  issn="0324-721X"
}