Skip header Section
Skip Bibliometrics Section
Syntax-Directed Semantics: Formal Models Based on Tree TransducersNovember 1998
- Authors:
- Zoltan Fulop,
- H. Vogler
Skip Abstract Section
Abstract
From the Publisher:
This is a motivated presentation of recent results on tree transducers, applied to studying the general properties of formal models and for providing semantics to context-free languages.
Cited By
Seidl H, Maneth S and Kemper G (2018). Equivalence of Deterministic Top-Down Tree-to-String Transducers Is Decidable, Journal of the ACM, 65:4, (1-30), Online publication date: 16-Aug-2018.- Engelfriet J, Fülöp Z and Maletti A (2017). Composition Closure of Linear Extended Top-down Tree Transducers, Theory of Computing Systems, 60:2, (129-171), Online publication date: 1-Feb-2017.
- Drewes F and Engelfriet J (2015). The generative power of delegation networks, Information and Computation, 245:C, (213-258), Online publication date: 1-Dec-2015.
- D'antoni L, Veanes M, Livshits B and Molnar D (2015). Fast, ACM Transactions on Programming Languages and Systems, 38:1, (1-32), Online publication date: 16-Oct-2015.
- Filiot E, Maneth S, Reynier P and Talbot J Decision Problems of Tree Transducers with Origin Proceedings, Part II, of the 42nd International Colloquium on Automata, Languages, and Programming - Volume 9135, (209-221)
- Labath P and Niehren J A Uniform Programmning Language for Implementing XML Standards Proceedings of the 41st International Conference on SOFSEM 2015: Theory and Practice of Computer Science - Volume 8939, (543-554)
- Bahr P and Axelsson E Generalising Tree Traversals to DAGs Proceedings of the 2015 Workshop on Partial Evaluation and Program Manipulation, (27-38)
- D'Antoni L, Veanes M, Livshits B and Molnar D Fast Proceedings of the 35th ACM SIGPLAN Conference on Programming Language Design and Implementation, (384-394)
- D'Antoni L, Veanes M, Livshits B and Molnar D (2014). Fast, ACM SIGPLAN Notices, 49:6, (384-394), Online publication date: 5-Jun-2014.
- D'Antoni L and Veanes M Equivalence of Extended Symbolic Finite Transducers Proceedings of the 25th International Conference on Computer Aided Verification - Volume 8044, (624-639)
- Matsuda K and Wang M FliPpr Proceedings of the 22nd European conference on Programming Languages and Systems, (101-120)
- Bahr P Modular tree automata Proceedings of the 11th international conference on Mathematics of Program Construction, (263-299)
- Veanes M, Hooimeijer P, Livshits B, Molnar D and Bjorner N Symbolic finite state transducers Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (137-150)
- Veanes M, Hooimeijer P, Livshits B, Molnar D and Bjorner N (2012). Symbolic finite state transducers, ACM SIGPLAN Notices, 47:1, (137-150), Online publication date: 18-Jan-2012.
- Morihata A Macro tree transformations of linear size increase achieve cost-optimal parallelism Proceedings of the 9th Asian conference on Programming Languages and Systems, (204-219)
- Veanes M and Bjørner N Symbolic tree transducers Proceedings of the 8th international conference on Perspectives of System Informatics, (377-393)
- Fülöp Z, Maletti A and Vogler H (2011). Weighted Extended Tree Transducers, Fundamenta Informaticae, 111:2, (163-202), Online publication date: 1-Apr-2011.
- Friese S, Seidl H and Maneth S Minimization of deterministic bottom-up tree transducers Proceedings of the 14th international conference on Developments in language theory, (185-196)
- Nederhof M Transforming lexica as trees Proceedings of the 2010 Workshop on Applications of Tree Automata in Natural Language Processing, (37-45)
- Bensch S and Drewes F Millstream systems Proceedings of the 2010 Workshop on Applications of Tree Automata in Natural Language Processing, (28-36)
- Katsumata S and Nishimura S (2008). Algebraic fusion of functions with an accumulating parameter and its improvement, Journal of Functional Programming, 18:5-6, (781-819), Online publication date: 1-Sep-2008.
- Maletti A (2008). Compositions of extended top-down tree transducers, Information and Computation, 206:9-10, (1187-1196), Online publication date: 1-Sep-2008.
- Drewes F From tree-based generators to delegation networks Proceedings of the 2nd international conference on Algebraic informatics, (48-72)
- Katsumata S and Nishimura S Algebraic fusion of functions with an accumulating parameter and its improvement Proceedings of the eleventh ACM SIGPLAN international conference on Functional programming, (227-238)
- Katsumata S and Nishimura S (2006). Algebraic fusion of functions with an accumulating parameter and its improvement, ACM SIGPLAN Notices, 41:9, (227-238), Online publication date: 16-Sep-2006.
- Engelfriet J and Maneth S The equivalence problem for deterministic MSO tree transducers is decidable Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science, (495-504)
- Högberg J Wind in the willows – generating music by means of tree transducers Proceedings of the 10th international conference on Implementation and Application of Automata, (153-162)
- Maneth S, Berlea A, Perst T and Seidl H XML type checking with macro tree transducers Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, (283-294)
- Maletti A and Vogler H (2005). Incomparability results for classes of polynomial tree series transformations, Journal of Automata, Languages and Combinatorics, 10:4, (535-568), Online publication date: 1-Apr-2005.
- Drewes F and Engelfriet J (2019). Branching synchronization grammars with nested tables, Journal of Computer and System Sciences, 68:3, (611-656), Online publication date: 1-May-2004.
- Perst T and Seidl H (2004). Macro forest transducers, Information Processing Letters, 89:3, (141-149), Online publication date: 14-Feb-2004.
- Fülöp Z and Vogler H (2004). Weighted tree transducers, Journal of Automata, Languages and Combinatorics, 9:1, (31-54), Online publication date: 1-Jan-2004.
- Drewes F and Engelfriet J Branching grammars Proceedings of the 7th international conference on Developments in language theory, (266-278)
- Gécseg F Comments on complete sets of tree automata Proceedings of the 7th international conference on Developments in language theory, (22-34)
Recommendations
Generalized Syntax Directed Translation, Tree Transducers, and Linear Space
When trees are denoted by “terms” or “parenthesized expressions”, which are strings, the class of top-down tree transducers (automata which map trees into trees and read their input trees from the root toward the leaves) form a subclass of a ...
Viewcharts: Syntax and Semantics
In this paper, we present a method for describing the syntax and semantics of viewcharts. Viewcharts is a visual formalism for describing the dynamic behavior of system components. We define the syntax of viewcharts as attributed graphs and, based on ...