Towards the Tree Automata Workbench Marbles

The conceptual ideas that are intended to become the basis for the tree automata workbench Marbles are sketched. The goal is to design and implement an extensible system that facilitates experiments with virtually any kind of algorithm on tree automata. Moreover, the system will be released with a library and an application programmer's interface to make it accessible to anyone who wants to apply tree automata algorithms in research and development.

[1]  Hans-Jörg Kreowski,et al.  Computing Raster Images from Grid Picture Grammars , 2000, CIAA.

[2]  Annegret Habel,et al.  Collages and patterns generated by hyperedge replacement , 1993 .

[3]  Jesse B. Wright,et al.  Algebraic Automata and Context-Free Sets , 1967, Inf. Control..

[4]  Annegret Habel,et al.  Decidable Boundedness Problems for Sets of Graphs Generated by Hyperedge-Replacement , 1991, Theor. Comput. Sci..

[5]  Hubert Comon,et al.  Tree automata techniques and applications , 1997 .

[6]  Hans-Jörg Kreowski,et al.  (Un-)Decidability of Geometric Properties of Pictures Generated by Collage Grammars , 1996, Fundam. Informaticae.

[7]  Zoltán Fülöp,et al.  Syntax-Directed Semantics: Formal Models Based on Tree Transducers , 2011 .

[8]  Joost Engelfriet,et al.  Macro Tree Transducers , 1985, J. Comput. Syst. Sci..

[9]  Joost Engelfriet,et al.  Decidability of the Finiteness of Ranges of Tree Transductions , 1998, Inf. Comput..

[10]  Parosh Aziz Abdulla,et al.  Regular Tree Model Checking , 2002, CAV.

[11]  Thomas Genet,et al.  Rewriting for Cryptographic Protocol Verification , 2000, CADE.

[12]  Frank Drewes,et al.  Language Theoretic and Algorithmic Properties of d-dimensional Collages and Patterns in a Grid , 1996, J. Comput. Syst. Sci..

[13]  Joost Engelfriet,et al.  SOME OPEN QUESTIONS AND RECENT RESULTS ON TREE TRANSDUCERS AND TREE LANGUAGES , 1980 .

[14]  Lisa Kaati.  Reduction Techniques for Finite (Tree) Automata , 2008 .

[15]  Frank Drewes.  Grammatical Picture Generation: A Tree-Based Approach (Texts in Theoretical Computer Science. An EATCS Series) , 2006 .

[16]  Reinhard Wilhelm,et al.  Tree automata for code selection , 1994, Acta Informatica.

[17]  Thomas Schwentick,et al.  Automata for XML - A survey , 2007, J. Comput. Syst. Sci..

[18]  Joost Engelfriet,et al.  Branching synchronization grammars with nested tables , 2004, J. Comput. Syst. Sci..

[19]  Frank Drewes,et al.  Tree-based picture generation , 2000, Theor. Comput. Sci..

[20]  Joost Engelfriet,et al.  Bottom-up and top-down tree transformations— a comparison , 1975, Mathematical systems theory.

[21]  H. Vogler,et al.  Weighted Tree Automata and Tree Transducers , 2009 .

[22]  Kevin Knight,et al.  An Overview of Probabilistic Tree Transducers for Natural Language Processing , 2005, CICLing.

[23]  Andreas Podelski,et al.  Tree Automata and Languages , 1992 .

[24]  Annegret Habel,et al.  Generating Self-Affine Fractals by Collage Grammars , 1995, Theor. Comput. Sci..

[25]  Christof Löding.  Model-Checking Infinite Systems Generated by Ground Tree Rewriting , 2002, FoSSaCS.

[26]  Frank Drewes,et al.  MAT Learners for Recognizable Tree Languages and Tree Series , 2009, Acta Cybern..

[27]  Valérie Viet Triem Tong,et al.  Reachability Analysis over Term Rewriting Systems , 2004, Journal of Automated Reasoning.

[28]  Bruno Courcelle,et al.  Attribute Grammars and Recursive Program Schemes II , 1982, Theor. Comput. Sci..

[29]  Frank Drewes.  Grammatical Picture Generation - A Tree-Based Approach , 2006, Texts in Theoretical Computer Science. An EATCS Series.

[30]  Ferenc Gécseg,et al.  Tree Languages , 1997, Handbook of Formal Languages.

[31]  Kevin Knight,et al.  Training Tree Transducers , 2004, NAACL.

[32]  Joost Engelfriet,et al.  Graph Grammars and Tree Transducers , 1994, CAAP.

[33]  Annegret Habel,et al.  Hyperedge Replacement, Graph Grammars , 1997, Handbook of Graph Grammars.

[34]  Björn Borchardt.  Code Selection by Tree Series Transducers , 2004, CIAA.

[35]  Hans-Jörg Kreowski,et al.  Picture generation by collage grammars , 1999 .

[36]  Annegret Habel,et al.  A Comparison of Compatible, Finite, and Inductive Graph Properties , 1993, Theor. Comput. Sci..