To order this title, and for more information, click here
Edited By M. Nivat, LITP, Université Paris VII, France A. Podelski, DIGITAL, Paris Research Laboratory, Centre de Recherche de Paris, Rueil-Malmaison, France
Description 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.
Contents 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).
Books and book related electronic products are priced in US dollars (USD), euro (EUR), and Great Britain Pounds (GBP). USD prices apply to the Americas and Asia Pacific. EUR prices apply in Europe and the Middle East. GBP prices apply to the UK and all other countries.
Home | Elsevier Sites | Privacy Policy | Terms and Conditions | Feedback | Site Map | A Reed Elsevier Company