Tree Automata and Languages
North-Holland (Verlag)
978-0-444-89026-9 (ISBN)
- Titel ist leider vergriffen;
keine Neuauflage - Artikel merken
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).
Erscheint lt. Verlag | 31.7.1992 |
---|---|
Reihe/Serie | Studies in Computer Science and Artificial Intelligence |
Zusatzinfo | 1 |
Sprache | englisch |
Gewicht | 830 g |
Themenwelt | Mathematik / Informatik ► Informatik ► Theorie / Studium |
Mathematik / Informatik ► Mathematik ► Graphentheorie | |
ISBN-10 | 0-444-89026-2 / 0444890262 |
ISBN-13 | 978-0-444-89026-9 / 9780444890269 |
Zustand | Neuware |
Haben Sie eine Frage zum Produkt? |
aus dem Bereich