On pure multi-pushdown automata that perform complete pushdown pops

Masopust, Tomáš and Meduna, Alexander: On pure multi-pushdown automata that perform complete pushdown pops. Acta cybernetica, (19) 2. pp. 537-552. (2009)

[img] Cikk, tanulmány, mű
Masopust_2009_ActaCybernetica.pdf

Download (83kB)

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.

Item Type: Article
Event Title: International Conference on Automata and Formal Languages, 12., 2008, Szeged
Journal or Publication Title: Acta cybernetica
Date: 2009
Volume: 19
Number: 2
Page Range: pp. 537-552
ISSN: 0324-721X
Language: angol
Uncontrolled Keywords: Természettudomány, Informatika
Additional Information: Bibliogr.: p. 551-552.; Abstract
Date Deposited: 2016. Oct. 15. 12:25
Last Modified: 2018. Jun. 06. 11:27
URI: http://acta.bibl.u-szeged.hu/id/eprint/12878

Actions (login required)

View Item View Item