+353-1-416-8900REST OF WORLD
+44-20-3973-8888REST OF WORLD
1-917-300-0470EAST COAST U.S
1-800-526-8630U.S. (TOLL FREE)


Tree Automata and Languages, Vol 10. Studies in Computer Science and Artificial Intelligence

  • ID: 1765247
  • Book
  • July 1992
  • Region: Global
  • Elsevier Science and Technology
1 of 3
The theory of tree languages, founded in the late Sixties and still active in the Seventies, was much less active during the Eighties. Now there is a simultaneous revival in several countries, with a number of significant results proved in the past five years. A large proportion of them appear in the present volume.

The editors of this volume suggested that the authors should write comprehensive half-survey papers. This collection is therefore useful for everyone interested in the theory of tree languages as it covers most of the recent questions which are not treated in the very few rather old standard books on the subject. Trees appear naturally in many chapters of computer science and each new property is likely to result in improvement of some computational solution of a real problem in handling logical formulae, data structures, programming languages on systems, algorithms etc. The point of view adopted here is to put emphasis on the properties themselves and their rigorous mathematical exposition rather than on the many possible applications.

This volume is a useful source of concepts and methods which may be applied successfully in many situations: its philosophy is very close to the whole philosophy of the ESPRIT Basic Research Actions and to that of the European Association for Theoretical Computer Science.

Please Note: This is an On Demand product, delivery may take up to 11 working days after payment has been received.

Note: Product cover images may vary from those shown
2 of 3
Binary Tree Codes (M. Nivat). Suffix, Prefix and Maximal Tree Codes (P. Aigrain, M. Nivat). A Monoid Approach to Tree Automata (A. Podelski). A Theory of Tree Language Varieties (M. Steinby). Interpretability and Tree Automata: A Simple Way to Solve Algorithmic Problems on Graphs Closely Related to Trees (D. Seese). Computing Trees with Graph Rewriting Systems with Priorities (I. Litovsky, Y. Métivier). Recognizable Sets of Unrooted Trees (B. Courcelle). Fixed Point Characterization of Weak Monadic Logic Definable Sets of Trees (A. Arnold, D. Niwiński). Automata on Infinite Trees and Rational Control (A. Saoudi, P. Bonizzoni). Recognizing Sets of Labelled Acyclic Graphs (P. Bonizzoni et al.). Rational and Recognizable Infinite Tree Sets (A. Saoudi). Algebraic Specification of Action Trees and Recursive Processes (M. Große-Rhode, C. Dimitrovici). Trees and Algebraic Semantics (I. Guessarian). A Survey of Tree Transductions (J.C. Raoult). Structural Complexity of Classes of Tree Languages (M. Dauchet, S. Tison). Ambiguity and Valuedness (H. Seidl). Decidability of the Inclusion in Monoids Generated by Tree Transformation Classes (Z. Fülöp, S. Vágvölgyi). Tree-adjoining Grammars and Lexicalized Grammars (A.K. Joshi, Y. Schabes). A Short Proof of the Factorization Forest Theorem (I. Simon). Unification Procedures in Automated Deduction Methods based on Matings: A Survey (J.H. Gallier).
Note: Product cover images may vary from those shown
3 of 3


4 of 3
Nivat, M.
Podelski, A.
Note: Product cover images may vary from those shown