Tree automata techniques and applications

CONTENTS 7 Acknowledgments Many people gave substantial suggestions to improve the contents of this book. These are, in alphabetic order, Introduction During the past few years, several of us have been asked many times about references on finite tree automata. On one hand, this is the witness of the liveness of this field. On the other hand, it was difficult to answer. Besides several excellent survey chapters on more specific topics, there is only one monograph devoted to tree automata by Gécseg and Steinby. Unfortunately, it is now impossible to find a copy of it and a lot of work has been done on tree automata since the publication of this book. Actually using tree automata has proved to be a powerful approach to simplify and extend previously known results, and also to find new results. For instance recent works use tree automata for application in abstract interpretation using set constraints, rewriting, automated theorem proving and program verification, databases and XML schema languages. Tree automata have been designed a long time ago in the context of circuit verification. Many famous researchers contributed to this school which was headed by A. Church in the late 50's and the early 60's: B. Trakhtenbrot, Many new ideas came out of this program. For instance the connections between automata and logic. Tree automata also appeared first in this framework, following the work of Doner, Thatcher and Wright. In the 70's many new results were established concerning tree automata, which lose a bit their connections with the applications and were studied for their own. In particular, a problem was the very high complexity of decision procedures for the monadic second order logic. Applications of tree automata to program verification revived in the 80's, after the relative failure of automated deduction in this field. It is possible to verify temporal logic formulas (which are particular Monadic Second Order Formulas) on simpler (small) programs. Automata, and in particular tree automata, also appeared as an approximation of programs on which fully automated tools can be used. New results were obtained connecting properties of programs or type systems or rewrite systems with automata. Our goal is to fill in the existing gap and to provide a textbook which presents the basics of tree automata and several variants of tree automata which have been devised for applications in the aforementioned domains. We shall discuss only finite tree automata, and the …

[1]  Witold Charatonik,et al.  Negative set constraints with equality , 1994, Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science.

[2]  Bruno Courcelle,et al.  Equivalences and Transformations of Regular Systems-Applications to Recursive Program Schemes and Grammars , 1986, Theor. Comput. Sci..

[3]  Nicolas Peltier,et al.  Tree Automata and Automated Model Building , 1997, Fundam. Informaticae.

[4]  Joxan Jaffar,et al.  An engine for logic program analysis , 1992, [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science.

[5]  Hubert Comon-Lundh.  Completion of Rewrite Systems with Membership Constraints. Part I: Deduction Rules , 1998, J. Symb. Comput..

[6]  Sophie Tison,et al.  Set Constraints and Automata , 1999, Inf. Comput..

[7]  Helmut Seidl,et al.  Haskell Overloading is DEXPTIME-Complete , 1994, Inf. Process. Lett..

[8]  Alexander Aiken,et al.  Solving systems of set constraints , 1992, [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science.

[9]  Max Dauchet,et al.  Rewriting and Tree Automata , 1993, Term Rewriting.

[10]  Sophie Tison,et al.  Equality and Disequality Constraints on Direct Subterms in Tree Automata , 1992, STACS.

[11]  Sophie Tison,et al.  The theory of ground rewrite systems is decidable , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

[12]  Arto Salomaa,et al.  Formal languages , 1973, Computer science classics.

[13]  M. Rabin.  Decidability of second-order theories and automata on infinite trees , 1968 .

[14]  Arto Salomaa,et al.  Aspects of Classical Language Theory , 1997, Handbook of Formal Languages.

[15]  Wayne Snyder,et al.  Theorem Proving Using Rigid E-Unification Equational Matings , 1987, LICS.

[16]  Sophie Tison,et al.  Structural complexity of classes of tree languages , 1992, Tree Automata and Languages.

[17]  Max Dauchet,et al.  Morphismes et Bimorphismes d'Arbres , 1982, Theor. Comput. Sci..

[18]  Hubert Comon,et al.  Inductive Proofs by Specification Transformation , 1989 .

[19]  Walter S. Brainerd,et al.  Tree Generating Regular Systems , 1969, Inf. Control..

[20]  Giora Slutzki,et al.  Alternating Tree Automata , 1983, Theor. Comput. Sci..

[21]  Helmut Seidl,et al.  Single-Valuedness of Tree Transducers is Decidable in Polynomial Time , 1992, Theor. Comput. Sci..

[22]  Yuri Gurevich,et al.  The Classical Decision Problem , 1997, Perspectives in Mathematical Logic.

[23]  Dexter Kozen.  Set Constraints and Logic Programming , 1994, CCL.

[24]  Alexander Aiken,et al.  Decidability of Systems of Set Constraints with Negative Constraints , 1994, Inf. Comput..

[25]  Rémi Gilleron,et al.  Proofs and Reachablity Problem for Ground Rewrite Systems , 1990, IMYCS.

[26]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[27]  Neil D. Jones,et al.  Flow analysis and optimization of LISP-like structures , 1979, POPL.

[28]  Sophie Tison,et al.  Fair Termination is Decidable for Ground Systems , 1989, RTA.

[29]  Prateek Mishra,et al.  Towards a Theory of Types in Prolog , 1984, SLP.

[30]  Thom W. Frühwirth,et al.  Logic programs as types for logic programs , 1991, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science.

[31]  K. Stefansson,et al.  Systems of set constraints with negative constraints are NEXPTIME-complete , 1994, Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science.

[32]  Jean Berstel,et al.  Recognizable Formal Power Series on Trees , 1982, Theor. Comput. Sci..

[33]  Margus Veanes,et al.  Rigid Reachability , 1998, ASIAN.

[34]  M. Veanes.  On Computational Complexity of Basic Decision Problems of Finite Tree Automata , 1997 .

[35]  Margus Veanes,et al.  On Simultaneous Rigid E-Unification , 1997 .

[36]  Denis Lugiez,et al.  Complement Problems and Tree Automata in AC-like Theories (Extended Abstract) , 1993, STACS.

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

[38]  Sophie Tison,et al.  Decidability of the Confluence of Ground Term Rewriting Systems , 1985, LICS.

[39]  james w.thatcher,et al.  tree automata: an informal survey , 1974 .

[40]  Thomas Genet,et al.  Decidable Approximations of Sets of Descendants and Sets of Normal Forms , 1998, RTA.

[41]  William H. Joyner.  Resolution Strategies as Decision Procedures , 1976, JACM.

[42]  John C. Reynolds,et al.  Automatic computation of data set definitions , 1968, IFIP Congress.

[43]  Dexter Kozen.  Logical Aspects of Set Constraints , 1993, CSL.

[44]  Michael A. Arbib,et al.  Algebra Automata I: Parallel Programming as a Prolegomena to the Categorical Approach , 1968, Inf. Control..

[45]  M. Tommasi,et al.  Automates et contraintes ensemblistes , 1994 .

[46]  Helmut Seidl.  Deciding Equivalence of Finite Tree Automata , 1990, SIAM J. Comput..

[47]  Z. Zachar,et al.  The solvability of the equivalence problem for deterministic frontier-to-root tree transducers , 1979, Acta Cybern..

[48]  Masako Takahashi,et al.  Generalizations of Regular Sets and Their Applicatin to a Study of Context-Free Languages , 1975, Inf. Control..

[49]  Paliath Narendran,et al.  The Decidability of Simultaneous Rigid E-Unification with One Variable , 1998, RTA.

[50]  Tadao Kasami,et al.  Solving a Unification Problem under Constrained Substitutions Using Tree Automata , 1994, FSTTCS.

[51]  Maurice Nivat,et al.  Resolution of Equations in Algebraic Structures , 1989 .

[52]  Joxan Jaffar,et al.  A decision procedure for a class of set constraints , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

[53]  Sándor Vágvölgyi,et al.  Congruential tree languages are the same as recognizable tree languages - a proof for a theorem of D. Kozen , 1989, Bull. EATCS.

[54]  Denis Lugiez,et al.  Tree Automata Help One To Solve Equational Formulae In AC-Theories , 1994, J. Symb. Comput..

[55]  Alfred V. Aho,et al.  Translations on a Context-Free Grammar , 1971, Inf. Control..

[56]  Makoto Murata,et al.  Hedge automata: a formal model for xml schemata , 1999 .

[57]  Jerzy Tiuryn.  Subtype inequalities , 1992, [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science.

[58]  Florent Jacquemard,et al.  Pumping, Cleaning and Symbolic Constraints Solving , 1994, ICALP.

[59]  Dexter Kozen.  Rational Spaces and Set Constraints , 1996, Theor. Comput. Sci..

[60]  Hubert Comon-Lundh,et al.  Equational Formulae with Membership Constraints , 1994, Inf. Comput..

[61]  Joxan Jaffar,et al.  A finite presentation theorem for approximating logic programs , 1989, POPL '90.

[62]  Michio Oyamaguchi.  NV-Sequentiality: A Decidable Condition for Call-by-Need Computations in Term-Rewriting Systems , 1993, SIAM J. Comput..

[63]  B. Bogaert.  Automates d'arbres avec tests d'égalites , 1990 .

[64]  Joachim Niehren,et al.  Feature Automata and Recognizable Sets of Feature Trees , 1993, TAPSOFT.

[65]  Florent Jacquemard,et al.  Decidable Approximations of Term Rewriting Systems , 1996, RTA.

[66]  Sándor Vágvölgyi,et al.  Bottom-Up Tree Pushdown Automata: Classification and Connection with Rewrite Systems , 1994, Theor. Comput. Sci..

[67]  James W. Thatcher,et al.  Characterizing Derivation Trees of Context-Free Grammars through a Generalization of Finite Automata Theory , 1967, J. Comput. Syst. Sci..

[68]  Géraud Sénizergues,et al.  The Equivalence Problem for Deterministic Pushdown Automata is Decidable , 1997, ICALP.

[69]  Tomás E. Uribe.  Sorted Unification Using Set Constraints , 1992, CADE.

[70]  Alain J. Mayer,et al.  Word Problems - This Time with Interleaving , 1991 .

[71]  Bruno Courcelle.  Recognizable sets of unrooted trees , 1992, Tree Automata and Languages.

[72]  Walter S. Brainerd,et al.  The Minimalization of Tree Automata , 1968, Inf. Control..

[73]  Jean-Claude Raoult,et al.  A survey of tree transductions , 1992, Tree Automata and Languages.

[74]  Andreas Podelski,et al.  Minimal Ascending and Descending Tree Automata , 1997, SIAM J. Comput..

[75]  Christoph Weidenbach,et al.  Soft Typing for Ordered Resolution , 1997, CADE.

[76]  Symeon Bozapalidis.  Equational Elements in Additive Algebras , 1999, Theory of Computing Systems.

[77]  Boris A. Trakhtenbrot.  Origins and metamorphoses of the Trinity: logic, nets, automata , 1995, Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science.

[78]  Sándor Vágvölgyi,et al.  Deterministic Top-Down Tree Transducers with Iterated Lookahead , 1995, Theor. Comput. Sci..

[79]  Zoltán Ésik,et al.  Decidability results concerning tree transducers II , 1983, Acta Cybern..

[80]  Brenda S. Baker.  Generalized Syntax Directed Translation, Tree Transducers, and Linear Space , 1978, SIAM J. Comput..

[81]  Derick Wood,et al.  One-Unambiguous Regular Languages , 1998, Inf. Comput..

[82]  Hubert Comon-Lundh.  Completion of Rewrite Systems with Membership Constraints. Part II: Constraint Solving , 1998, J. Symb. Comput..

[83]  Sophie Tison,et al.  Solving systems of set constraints with negated subset relationships , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[84]  Bruno Courcelle,et al.  A Representation of Trees by Languages II , 1978, Theor. Comput. Sci..

[85]  S. Sieber.  On a decision method in restricted second-order arithmetic , 1960 .

[86]  Moshe Y. Vardi.  An Automata-Theoretic Approach to Linear Temporal Logic , 1996, Banff Higher Order Workshop.

[87]  Andreas Podelski,et al.  Set constraints with intersection , 1997, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science.

[88]  Werner Kuich,et al.  Full Abstract Families of Tree Series I , 1999, Jewels are Forever.

[89]  Jean H. Gallier,et al.  Reductions in Tree Replacement Systems , 1985, Theor. Comput. Sci..

[90]  Kai Salomaa,et al.  Deterministic Tree Pushdown Automata and Monadic Tree Rewriting Systems , 1988, J. Comput. Syst. Sci..

[91]  Ralf Treinen,et al.  The First-Order Theory of One-Step Rewriting is Undecidable , 1996, RTA.

[92]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[93]  Andreas Podelski,et al.  A monoid approach to tree automata , 1992, Tree Automata and Languages.

[94]  J. Van Leeuwen,et al.  Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .

[95]  Joost Engelfriet,et al.  Modular Tree Transducers , 1991, Theor. Comput. Sci..

[96]  Jean-Marc Talbot,et al.  Solving Classes of Set Constraints with Tree Automata , 1997, CP.

[97]  Denis Lugiez,et al.  Multitrees Automata , Presburger ’ s Constraints and Tree Logics , 2022 .

[98]  Hubert Comon-Lundh,et al.  Higher-Order Matching and Tree Automata , 1997, CSL.

[99]  Max Dauchet,et al.  Transformations de noyaux reconnaissables , 1979, FCT.

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

[101]  Wolfgang Thomas,et al.  Languages, Automata, and Logic , 1997, Handbook of Formal Languages.

[102]  Bruno Courcelle,et al.  A Representation of Trees by Languages I , 1978, Theor. Comput. Sci..

[103]  Michael A. Arbib,et al.  Tree transformations and the semantics of loop-free programs , 1978, Acta Cybernetica.

[104]  John Doner,et al.  Tree Acceptors and Some of Their Applications , 1970, J. Comput. Syst. Sci..

[105]  Alexander Aiken,et al.  The Complexity of Set Constraints , 1993, CSL.

[106]  Gregory Kucherov.  On Relationship Between Term Rewriting Systems and Regular Tree Languages , 1991, RTA.

[107]  James W. Thatcher,et al.  Generalized Sequential Machine Maps , 1970, J. Comput. Syst. Sci..

[108]  J. Engelfriet.  Top-down tree transducers with regular look-ahead , 1975 .

[109]  B. Courcelle.  On Recognizable Sets and Tree Automata , 1989 .

[110]  Jesse B. Wright,et al.  Automata in General Algebras , 1967, Inf. Control..

[111]  Alejandro Barrero.  Unranked tree languages , 1991, Pattern Recognit..

[112]  David A. Plaisted,et al.  Semantic Confluence Tests and Completion Methods , 1985, Inf. Control..

[113]  Hubert Comon,et al.  Sequentiality, second order monadic logic and tree automata , 1995, Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science.

[114]  Dexter Kozen,et al.  A Complete Gentzen-Style Axiomatization for Set Constraints , 1996, ICALP.

[115]  Jean-Jacques Lévy,et al.  Computations in Orthogonal Rewriting Systems, II , 1991, Computational Logic - Essays in Honor of Alan Robinson.

[116]  Witold Charatonik,et al.  Set constraints with projections are in NEXPTIME , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[117]  Nevin Charles Heintze,et al.  Set based program analysis , 1992 .

[118]  Zoltán Ésik,et al.  Decidability results concerning tree transducers I , 1980, Acta Cybern..

[119]  Harald Ganzinger,et al.  Set constraints are the monadic class , 1993, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science.

[120]  Sophie Tison,et al.  Regular Tree Languages and Rewrite Systems , 1995, Fundam. Informaticae.

[121]  Dexter Kozen.  On the Myhill-Nerode Theorem for Trees , 1992 .

[122]  Alain Quéré,et al.  Définition et Etude des Bilangages Réguliers , 1968, Inf. Control..

[123]  Kai Salomaa,et al.  Synchronized Tree Automata , 1994, Theor. Comput. Sci..

[124]  Maurice Nivat,et al.  Transduction des langages de Chomsky , 1968 .

[125]  Alexander Aiken,et al.  Implementing Regular Tree Expressions , 1991, FPCA.

[126]  H. Comon.  Completion of Rewrite Systems with Membership Constraints Part I: Deduction Rules☆ , 1998 .

[127]  H. Comon.  Completion of Rewrite Systems with Membership Constraints Part II , 1998 .