Tree Automata and Languages

Tree Automata and Languages

by M. Nivat
     
 

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

See more details below

Overview

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.

Read More

Product Details

ISBN-13:
9780444890269
Publisher:
Elsevier Science
Publication date:
11/22/1992
Series:
Studies in Computer Science and Artificial Intelligence Series, #10
Pages:
496
Product dimensions:
1.13(w) x 6.14(h) x 9.21(d)

Meet the Author

Table of Contents

Foreword
Binary tree codes1
Suffix, prefix and maximal tree codes21
A monoid approach to tree automata41
A theory of tree language varieties57
Interpretability and tree automata: A simple way to solve algorithmic problems on graphs closely related to trees83
Computing trees with graph rewriting systems with priorities115
Recognizable sets of unrooted trees141
Fixed point characterization of weak monadic logic definable sets of trees159
Automata on infinite trees and rational control189
Recognizing sets of labelled acyclic graphs201
Rational and recognizable infinite tree sets225
Algebraic specification of action trees and recursive processes235
Trees and algebraic semantics291
A survey of tree transductions311
Structural complexity of classes of tree languages327
Ambiguity and valuedness355
Decidability of the inclusion in monoids generated by tree transformation classes381
Tree-adjoining grammars and lexicalized grammars409
A short proof of the factorization forest theorem433
Unification procedures in automated deduction methods based on matings: A survey439

Read More

Customer Reviews

Average Review:

Write a Review

and post it to your social network

     

Most Helpful Customer Reviews

See all customer reviews >