OASIcs.SLATE.2018.6.pdf
- Filesize: 470 kB
- 12 pages
Document
Construction of a Pushdown Automaton Accepting a Postfix Notation of a Tree Language Given by a Regular Tree Expression
Authors
-
Part of:
Volume:
7th Symposium on Languages, Applications and Technologies (SLATE 2018)
Series: Open Access Series in Informatics (OASIcs)
Conference: Symposium on Languages, Applications and Technologies (SLATE) - License:
Creative Commons Attribution 3.0 Unported license
- Publication Date: 2018-07-13
Cite As Get BibTex
Tomás Pecka, Jan Trávnícek, Radomír Polách, and Jan Janousek. Construction of a Pushdown Automaton Accepting a Postfix Notation of a Tree Language Given by a Regular Tree Expression. In 7th Symposium on Languages, Applications and Technologies (SLATE 2018). Open Access Series in Informatics (OASIcs), Volume 62, pp. 6:1-6:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
https://doi.org/10.4230/OASIcs.SLATE.2018.6
Abstract
Regular tree expressions are a formalism for describing regular tree languages, which can be accepted by a finite tree automaton as a standard model of computation. It was proved that the class of regular tree languages is a proper subclass of tree languages whose linear notations can be accepted by deterministic string pushdown automata. In this paper, we present a new algorithm for transforming regular tree expressions to equivalent real-time height-deterministic pushdown automata that accept the trees in their postfix notation.
Subject Classification
ACM Subject Classification
- Theory of computation → Models of computation
Keywords
- tree
- regular tree expression
- pushdown automaton
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads
References
-
Alfred V. Aho and Jeffrey D. Ullman. The theory of parsing, translation, and compiling. 1: Parsing. Prentice-Hall, 1972.
- Rajeev Alur and Parthasarathy Madhusudan. Visibly pushdown languages. In 36th Symposium on Theory of Computing, pages 202-211, 2004. URL: http://dx.doi.org/10.1145/1007352.1007390.
-
Valentin M. Antimirov. Partial derivatives of regular expressions and finite automaton constructions. Theoretical Computer Science, 155(2):291-319, 1996.
- Janusz A. Brzozowski. Derivatives of regular expressions. Journal of the ACM, 11(4):481-494, 1964. URL: http://dx.doi.org/10.1145/321239.321249.
- Hubert Comon, Max Dauchet, Remi Gilleron, Florent Jacquemard, Denis Lugiez, Christof Löding, Sofia Tison, and Marc Tommasi. Tree automata techniques and applications, 2007. Available on: URL: http://www.grappa.univ-lille3.fr/tata.
-
Tomáš Flouri, Jan Janoušek, and Bořivoj Melichar. Subtree matching by pushdown automata. Computer Science and Information Systems, 7(2):331-357, 2010.
- Victor Mikhailovich Glushkov. The abstract theory of automata. Russian Mathematical Surveys, 16(5), 1961. URL: http://dx.doi.org/10.1070/RM1961v016n05ABEH004112.
-
John E. Hopcroft, Rajeev Motwani, and Jeffrey D. Ullman. Introduction to automata theory, languages, and computation. Addison-Wesley, 2nd edition, 2003.
- Jan Janoušek and Bořivoj Melichar. On regular tree languages and deterministic pushdown automata. Acta Informatica, 46(7):533-547, 2009. URL: http://dx.doi.org/10.1007/s00236-009-0104-9.
- Viraj Kumar, Parthasarathy Madhusudan, and Mahesh Viswanathan. Visibly pushdown automata for streaming XML. In 16th International Conference on World Wide Web, pages 1053-1062, 2007. URL: http://dx.doi.org/10.1145/1242572.1242714.
- Dietrich Kuske and Ingmar Meinecke. Construction of tree automata from regular expressions. In 12th International Conference on Developments in Language Theory, pages 491-503, 2008. URL: http://dx.doi.org/10.1007/978-3-540-85780-8_39.
- Éric Laugerotte, Nadia Ouali Sebti, and Djelloul Ziadi. From regular tree expression to position tree automaton. In 7th International Conference on Language and Automata Theory and Applications (LATA), pages 395-406, 2013. URL: http://dx.doi.org/10.1007/978-3-642-37064-9_35.
- Dirk Nowotka and Jiří Srba. Height-deterministic pushdown automata. In 32nd International Symposium Mathematical Foundations of Computer Science (MFCS), pages 125-134, 2007. URL: http://dx.doi.org/10.1007/978-3-540-74456-6_13.
-
Radomír Polách, Jan Janoušek, and Bořivoj Melichar. Regular tree expressions and deterministic pushdown automata. In 7th Doctoral Workshop on Mathematical and Engineering Methods in Computer Science, pages 70-77, 2011.
- Radomír Polách, Jan Trávníček, Jan Janoušek, and Bořivoj Melichar. Efficient determinization of visibly and height-deterministic pushdown automata. Computer Languages, Systems & Structures, 46:91-105, 2016. URL: http://dx.doi.org/10.1016/j.cl.2016.07.005.
-
Grzegorz Rozenberg and Arto Salomaa, editors. Handbook of Formal Languages, Vol. 1: Word, Language, Grammar. Springer-Verlag, 1997.
- Tom Sebastian and Joachim Niehren. Projection for nested word automata speeds up xpath evaluation on XML streams. In 42nd International Conference on Current Trends in Theory and Practice of Computer Science, pages 602-614, 2016. URL: http://dx.doi.org/10.1007/978-3-662-49192-8_49.
- Ken Thompson. Programming techniques: Regular expression search algorithm. Communications of the ACM, 11(6):419-422, 1968. URL: http://dx.doi.org/10.1145/363347.363387.