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 ve sborníku mimo WoS a Scopus

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. During this operation, the entire pushdown is compared with a prefix of the input, and if they match, the pushdown is completely emptied 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. If these automata are allowed to join their pushdowns and create new pushdowns, then they define another infinite hierarchy of language families according to the number of pushdowns.

Klíčová slova

pure multi-pushdown automaton, complete-pushdown pop, infinite hierarchy

Autoři

MASOPUST, T.; MEDUNA, A.

Rok RIV

2008

Vydáno

27. 5. 2008

Nakladatel

Computer and Automation Research Institute, Hungarian Academy of Sciences

Místo

Balatonfured

ISBN

978-963-311-367-7

Kniha

Automata and Formal Languages. The 12th International Conference, AFL 2008, Balatonfured, Hungary, May 27-30, 2008, Proceedings

Strany od

325

Strany do

336

Strany počet

12

BibTex

@inproceedings{BUT27768,
  author="Tomáš {Masopust} and Alexandr {Meduna}",
  title="On Pure Multi-Pushdown Automata that Perform Complete-Pushdown Pops",
  booktitle="Automata and Formal Languages. The 12th International Conference, AFL 2008, Balatonfured, Hungary, May 27-30, 2008, Proceedings",
  year="2008",
  pages="325--336",
  publisher="Computer and Automation Research Institute, Hungarian Academy of Sciences",
  address="Balatonfured",
  isbn="978-963-311-367-7"
}