Detail výsledku

Reducing Deep Pushdown Automata

KŘIVKA, Z.; SCHÖNECKER, R. Reducing Deep Pushdown Automata. Proceedings of the 12th Conference and Competition STUDENT EEICT 2006 Volume 4. Brno: Faculty of Information Technology BUT, 2006. p. 365-369. ISBN: 80-214-3163-6.
Typ
článek ve sborníku konference
Jazyk
anglicky
Autoři
Křivka Zbyněk, Ing., Ph.D., UIFS (FIT)
Schönecker Rudolf, Ing., UIFS (FIT)
Abstrakt

This contribution presents reducing variant of the deep pushdown automata.
Deep pushdown automata is a new generalization of the classical pushdown automata.
Basic idea of the modification consists of allowing these automata to access more deeper parts of pushdown
and reducing strings to non-input symbols in the pushdown.
It works similarly to bottom-up analysis simulation of context-free grammars in the classical pushdown automata.
Further, this paper presents results of equivalence of reducing deep pushdown automata with n-limited state grammars
and infinite hierarchy of language families based on that.

Klíčová slova
Deep Pushdown Automata, State Grammars, Infinite hierarchy, Deep Bottom-Up Parser
URL
Rok
2006
Strany
365–369
Sborník
Proceedings of the 12th Conference and Competition STUDENT EEICT 2006 Volume 4
Konference
Student EEICT 2006
ISBN
80-214-3163-6
Vydavatel
Faculty of Information Technology BUT
Místo
Brno
BibTeX 
@inproceedings{BUT192592,
  author="Zbyněk {Křivka} and Rudolf {Schönecker}",
  title="Reducing Deep Pushdown Automata",
  booktitle="Proceedings of the 12th Conference and Competition STUDENT EEICT 2006 Volume 4",
  year="2006",
  pages="365--369",
  publisher="Faculty of Information Technology BUT",
  address="Brno",
  isbn="80-214-3163-6",
  url="http://www.feec.vutbr.cz/EEICT/2006/sbornik/03-Doktorske_projekty/07-Informacni_systemy/04-krivka.pdf"
}
Pracoviště
Ústav informačních systémů (UIFS)
Nahoru