Hubert Comon, Max Dauchet, Rémi Gilleron, Florent Jacquemard, Denis Lugiez, Sophie Tison, Marc Tommasi  Home/Search
Context
Related
| grappa.univlille3.fr/tat...chap2.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: grappa.univlille3.fr/tata/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Contents Introduction 9 Preliminaries 13 1 Recognizable Tree Languages and Finite Tree Automata 17 1.1 Finite Tree Automata . . . . . . . . . . . . . . . . . . . . . . . . 18 1.2 The Pumping Lemma for Recognizable Tree Languages . . . . . 26 1.3 Closure Properties of Recognizable Tree Languages . . . . . . . . 27 1.4 Tree Homomorphisms . . . . . . . . . . . . . . . . . . . . . . . . 29 1.5 Minimizing Tree Automata . . . . . . . . . . . . . . . . . . . . . 33 1.6 Top Down Tree Automata . . . .... (Update)
Similar documents (at the sentence level): More
27.5%: Tree Automata Techniques and Applications -.. - Comon, Dauchet.. (1998) (Correct)
27.5%: Tree Automata Techniques and Applications -.. - Comon, Dauchet.. (Correct)
27.2%: Tree Automata Techniques and Applications -.. - Comon, Dauchet.. (1998) (Correct)
Active bibliography (related documents): More All
0.7: Homomorphisms and Concurrent Term Rewriting - Seynhaeve, Tison, Tommasi (1999) (Correct)
0.6: Rigid Reachability The Non-Symmetric Form Of Rigid E-Unification - Ganzinger (2000) (Correct)
0.5: The complete list of RTA open problems - Date April Summary (Correct)
Similar documents based on text: More All
1.2: Tree-Walking Pebble Automata - Engelfriet, Hoogeboom (1999) (Correct)
1.1: The Recognizability Problem for Tree Automata with.. - Bogaert, Seynhaeve.. (1999) (Correct)
1.1: Residual Finite Tree Automata - Carme, Gilleron, Lemay, Terlutte.. (2003) (Correct)
BibTeX entry: (Update)
H. Comon, M. Dauchet, R. Gilleron, D. Lugiez, S. Tison, and M. Tommasi. Tree Automata Techniques and Applications. Draft, 1998. http://citeseer.ist.psu.edu/article/comon98tree.html More
@misc{ comon98tree,
author = "H. Comon and M. Dauchet and R. Gilleron and D. Lugiez and S. Tison and
M. Tommasi",
title = "Tree Automata Techniques and Applications",
text = "H. Comon, M. Dauchet, R. Gilleron, D. Lugiez, S. Tison, and M. Tommasi.
Tree Automata Techniques and Applications. Draft, 1998.",
year = "1998",
url = "citeseer.ist.psu.edu/article/comon98tree.html" }
Citations (may not include all citations):1911 Introduction to Automata Theory (context) - Hopcroft, Ullman - 1979
241 Decidability of Second-Order Theories and Automata on In nit.. (context) - Rabin - 1969
220 Formal Languages (context) - Salomaa - 1973
207 Flow Analysis and Optimization of LISP-like Structures (context) - Jones, Muchnick - 1979
176 a decision method in a restricted second order arithmetic (context) - Bchi - 1960
131 Set Based Program Analysis - Heintze - 1992
124 Journal of the ACM (context) - Chandra, Kozen et al. - 1981
121 Handbook of Theoretical Computer Science (context) - Dershowitz, Jouannaud - 1990
113 Akademiai Kiado (context) - Gcseg, Steinby - 1984
111 Solving Systems of Set Constraints (context) - Aiken, Wimmers
105 Word problems requiring exponential time (context) - Stockmeyer, Meyer - 1973
103 Tree acceptors and some of their applications (context) - Doner - 1970
91 Towards a Theory of Types in PROLOG (context) - Mishra - 1984
86 An automata-theoretic approach to branching time model-check.. - Kupferman, Vardi et al. - 2000
82 A Decision Procedure for a Class of Set Constraints - Heintze, Ja - 1990
81 Handbook of Theoretical Computer Science (context) - Thomas - 1990
79 Tree languages (context) - Gcseg, Steinby - 1996
76 Set constraints are the monadic class - Bachmair, Ganzinger et al. - 1993
75 Completion of rewrite systems with membership constraints - Comon - 1998
75 Completion of rewrite systems with membership constraints - Comon - 1998
57 The complexity of set constraints - Aiken, Kozen et al. - 1993
53 automata and logic (context) - Thomas - 1997
52 Decidability of systems of set constraints with negative con.. - Aiken, Kozen et al. - 1995
50 Solving systems of set constraints with negated subset relat.. (context) - Gilleron, Tison et al. - 1993
50 Implementing regular tree expressions - Aiken, Murphy - 1991
47 Resolution strategies as decision procedures (context) - Jr - 1976
46 Translations on a context-free grammar (context) - Aho, Ullmann - 1971
45 Haskell overloading is DEXPTIME-complete (context) - Seidl - 1994
44 Tree automata: an informal survey (context) - Thatcher - 1973
44 Set constraints with projections are in NEXPTIME - Charatonik, Pacholski - 1994
44 Algebraic automata and context-free sets (context) - Mezei, Wright - 1967
43 Subtype inequalities (context) - Tiuryn
42 Negative set constraints with equality - Charatonik, Pacholski - 1994
42 The theory of ground rewrite systems is decidable (context) - Dauchet, Tison - 1990
40 Taxonomy of xml schema languages using formal language theor.. - Murata, Lee et al. - 2001
38 Set Constraints with Intersection - Charatonik, Podelski
36 Logical aspects of set constraints - Kozen - 1993
36 Decidable approximations of sets of descendants and sets of .. - Genet - 1997
34 Equational formulae with membership constraints - Comon, Delor - 1994
34 second-order monadic logic and tree automata (context) - Comon - 1995
33 Decidable approximations of term rewriting systems (context) - Jacquemard - 1996
32 An engine for logic program analysis - Heintze, Ja
32 Tree generating regular systems (context) - Brainerd - 1969
30 Equality and disequality constraints on direct subterms in t.. (context) - Bogaert, Tison - 1992
30 Top-down tree transducers with regular look-ahead (context) - Engelfriet - 1977
29 NV-sequentiality: a decidable condition for callby -need com.. (context) - Oyamaguchi - 1993
29 Solving classes of set constraints with tree automata - Devienne, Talbot et al. - 1997
28 Automata in general algebras (context) - Eilenberg, Wright - 1967
27 Equivalences and transformations of regular systems applica.. (context) - Courcelle - 1986
26 Systems of set constraints with negative constraints are nex.. (context) - Stefansson - 1994
24 Three hierarchies of transducers (context) - Engelfriet - 1982
23 Computations in orthogonal rewriting systems (context) - Huet, Lvy - 1979
21 cleaning and symbolic constraints solving (context) - Caron, Comon et al. - 1994
21 Automata-driven automated induction - Bouhoula, Jouannaud
21 Hedge Automata: a Formal Model for XML Schemata - Murata - 2000
20 Feature automata and recognizable sets of feature trees - Niehren, Podelski - 1993
20 Soft typing for ordered resolution - Ganzinger, Meyer et al. - 1997
20 Higher-order matching and tree automata - Comon, Jurski - 1997
20 Aspects of classical language theory (context) - Mateescu, Salomaa - 1996
20 Logic programs as types for logic programs (context) - Frhwirth, Shapiro et al. - 1991
20 Deterministic tree pushdown automata and monadic tree rewrit.. (context) - Salomaa - 1988
19 Rewriting and tree automata (context) - Dauchet - 1994
19 A method for automatic cryptographic protocol veri cation - Goubault-Larrecq - 2000
19 Ground reducibility is EXPTIMEcomplete - Comon, Jacquemard
19 Transductions des langages de Chomsky (context) - Nivat - 1968
17 Tree automata and automated model building - Peltier - 1997
17 Complement problems and tree automata in AC-like theories (context) - Lugiez, Moysset - 1993
17 Decidable call by need computations in term rewriting - Durand, Middeldorp - 1997
17 Regular tree languages and rewrite systems (context) - Gilleron, Tison - 1995
16 Reductions in tree replacement systems (context) - Gallier, Book - 1985
16 Laboratoire d'Informatique Fondamentale de Lille (context) - Mongy, reconnaissables et al. - 1981
15 Origins and metamorphoses of the trinity: Logic (context) - Trakhtenbrot - 1995
15 nite tree automata (context) - Seidl, of - 1990
15 Recognizable formal power series on trees (context) - Berstel, Reutenauer - 1982
15 Decidability of the weak second-order theory of two successo.. (context) - Doner - 1965
15 Tree automata help one to solve equational formulae in ac-th.. - Lugiez, Moysset - 1994
15 Information and Computation (context) - Kozen, logic - 1998
15 nite tree automata (context) - Seidl, of - 1989
15 Beyond the regularity: Equational tree automata for associat.. (context) - Ohsaki - 2001
14 Proofs and reachability problem for ground rewrite systems (context) - Coquid, Gilleron - 1990
14 Rational spaces and set constraints - Kozen - 1995
14 Decidability results concerning tree transducers (context) - Esik - 1983
13 nite automata with an application to a decision problem of s.. (context) - Thatcher, Wright - 1968
13 On computational complexity of basic decision problems of n.. - Veanes - 1997
13 On relationship between term rewriting systems and regular t.. (context) - Kucherov - 1991
13 A monoid approach to tree automata (context) - Podelski - 1992
13 Generalized syntax directed translation (context) - Baker - 1978
13 A complete Gentzen-style axiomatization for set constraints - Cheng, Kozen - 1996
13 Minimal ascending and descending tree automata (context) - Nivat, Podelski - 1997
12 Bulletin of the European Association of Theoretical Computer.. (context) - Kozen, Myhill-Nerode et al. - 1992
12 Handbook of Mathematical Logic (context) - Rabin - 1977
12 Computing Science Department (context) - Veanes, rigid et al. - 1997
12 Information and Control (context) - Plaisted, uence et al. - 1985
11 Equational elements in additive algebras (context) - Bozapalidis - 1999
11 Explicit representation of terms de ned by counter examples (context) - Lassez, Marriott - 1987
11 nite presentation theorem for approximating logic programs (context) - Heintze, Ja - 1990
11 Deterministic top-down tree transducers with iterated look-a.. - Slutzki, Vagvolgyi - 1995
11 Reduction properties and automata with constraints (context) - Dauchet, Caron et al. - 1995
11 The solvability of the equivalence problem for deterministic.. (context) - Zachar
10 The equivalence problem for deterministic pushdown automata .. (context) - Snizergues - 1997
10 Rigid reachability - Ganzinger, Jacquemard et al. - 1998
10 The minimalization of tree automata (context) - Brainerd - 1968
10 Decidability for left-linear growing term rewriting systems (context) - Nagaya, Toyama - 1999
10 Algebra automata I: Parallel programming as a prolegomena to.. (context) - Arbib, Give'on - 1968
10 Bottomup tree pushdown automata : Classi cation and connecti.. (context) - Coquide, Dauchet et al. - 1994
10 Morphismes et bimorphismes d'arbres (context) - Arnold, Dauchet - 1982
10 Structural complexity of classes of tree languages (context) - Dauchet, Tison - 1992
10 The decidability of simultaneous rigid e-uni cation with one.. (context) - Degtyarev, Gurevich et al. - 1998
9 Single-valuedness of tree transducers is decidable in polyno.. (context) - Seidl - 1992
9 presburger 's constraints and tree logics (context) - Lugiez, DalZilio - 2002
9 rst-order theory of one-step rewriting is undecidable (context) - Treinen - 1996
9 Theorem proving using rigid E-uni cation: Equational matings (context) - Gallier, Raatz et al. - 1987
9 Recognizable sets of unrooted trees (context) - Courcelle - 1992
8 IO and OI II (context) - Engelfriet, Schmidt - 1978
8 A hierarchy of tree transducers (context) - Engelfriet - 1978
8 the parallel complexity of tree automata - Lohrey - 2001
8 Contraintes ensemblistes (context) - Seynhaeve - 1994
8 Generalized sequential machines (context) - Thatcher - 1970
8 Bottom-up and top-down tree transformations (context) - Engelfriet - 1975
8 A survey of tree transductions (context) - Raoult - 1992
8 Automates et contraintes ensemblistes (context) - Tommasi - 1994
8 Inductive proofs by speci cation transformations (context) - Comon - 1989
8 chapter Resolution of Equations in Algebraic Structures (context) - Courcelle, Sets et al. - 1989
8 Automatic Computation of Data Set De nition (context) - Reynolds - 1969
7 Theorical Computer Science (context) - Engelfriet, Vogler et al. - 1991
7 Synchronized tree automata (context) - Salomaa - 1994
7 Perspectives of Mathematical Logic (context) - Brger, Grdel et al. - 1997
7 Tree transformations and semantics of loop-free programs (context) - Arbib, Manes - 1978
7 nite-valued tree transducers is decidable (context) - Seidl - 1994
7 IEEE Computer Society Press (context) - McAllester, Givan et al. - 1996
7 Context-free series on trees (context) - Bozapalidis - 2001
7 cation problem under constrained substitutions using tree au.. (context) - Kaji, Fujiwara et al. - 1997
7 Theorical Computer Science (context) - Slutzki, automata - 1985
7 Information and Control (context) - Gilleron, Tison et al. - 1999
7 cation Using Set Constraints (context) - Uribe - 1992
7 nition et tude des bilangages rguliers (context) - Pair, Quere - 1968
7 chapter Tree monoids and recognizable sets of nite trees (context) - Nivat, Podelski et al. - 1989
7 chapter Flow analysis of lazy higher-order functional progra.. (context) - Jones, of - 1987
7 Congruential tree languages are the same as recognizable tre.. (context) - Flp, Vgvlgyi - 1989
7 Full abstract families of tree series (context) - Kuich - 1999
7 Automates d'arbres avec tests d'galit entre cousins germains (context) - Tommasi - 1992
7 uence of ground term rewriting systems (context) - Dauchet, Tison et al. - 1987
7 Mathematical System Theory (context) - Guessarian, automata - 1983
7 Information and Computation (context) - Kuich, automata et al. - 2001
7 A characterization of irreducible sets modulo left-linear te.. (context) - Flp, Vgvlgyi - 1988
7 Regular tree and regular hedge languages over unranked alpha.. (context) - Brggemann-Klein, Murata et al. - 2001
7 Formal Models Based on Tree Transducers (context) - Flp, Vgler - 1998
Documents on the same site (http://www.grappa.univ-lille3.fr/tata/): More
Tree Automata Techniques and Applications -.. - Comon, Dauchet.. (1998) (Correct)
Tree Automata Techniques and Applications -.. - Comon, Dauchet.. (1998) (Correct)
Tree Automata Techniques and Applications -.. - Comon, Dauchet.. (1998) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC