Alternating tree automata and parity gamesKIRSTEN, Daniel.Lecture notes in computer science. 2002, pp 153-167, issn 0302-9743, isbn 3-540-00388-6, 15 p.Conference Paper

Weak Muller acceptance conditions for tree automataLA TORRE, Salvatore; MURANO, Aniello; NAPOLI, Margherita et al.Lecture notes in computer science. 2002, pp 240-254, issn 0302-9743, isbn 3-540-43631-6Conference Paper

Beyond regularity: Equational tree automata for associative and commutative theoriesOHSAKI, Hitoshi.Lecture notes in computer science. 2001, pp 539-553, issn 0302-9743, isbn 3-540-42554-3Conference Paper

Autowrite: A tool for checking properties of term rewriting systemsDURAND, Irène.Lecture notes in computer science. 2002, pp 371-375, issn 0302-9743, isbn 3-540-43916-1, 5 p.Conference Paper

The monadic theory of tree-like structuresBERWANGER, Dietmar; BLUMENSATH, Achim.Lecture notes in computer science. 2002, pp 285-301, issn 0302-9743, isbn 3-540-00388-6, 17 p.Conference Paper

Kleene's theorem for weighted tree-automataPECH, Christian.Lecture notes in computer science. 2003, pp 387-399, issn 0302-9743, isbn 3-540-40543-7, 13 p.Conference Paper

The Borel hierarchy is infinite in the class of regular sets of treesSKURCZYNSKI, J.Theoretical computer science. 1993, Vol 112, Num 2, pp 413-418, issn 0304-3975Article

Languages accepted by systolic Y-tree automata : structural characterizations = Langages acceptés par les automates à Y-arbres systoliques : caractérisations structurellesFACHINI, E; MONTI, A; NAPOLI, M et al.Acta informatica. 1992, Vol 29, Num 8, pp 761-778, issn 0001-5903Article

The recognizability problem for tree automata with comparisons between brothersBOGAERT, B; SEYNHAEVE, F; TISON, S et al.Lecture notes in computer science. 1999, pp 150-164, issn 0302-9743, isbn 3-540-65719-3Conference Paper

Quantaloidal nuclei, the syntactic congruence and tree automataROSENTHAL, K. I.Journal of pure and applied algebra. 1992, Vol 77, Num 2, pp 189-205, issn 0022-4049Article

Efficient learning of regular tree languages and applicationsBESOMBES, Jérome; MARION, Jean-Yves.Knowledge discovery and discrete mathematics. International conferenceJIM'2003 : journées de l'informatique messine. 2003, pp 169-180, isbn 2-7261-1256-0, 12 p.Conference Paper

A fast algorithm for constructing a tree automaton recognizing a congruential tree languageVAGVÖLGYI, S.Theoretical computer science. 1993, Vol 115, Num 2, pp 391-399, issn 0304-3975Article

«Structures et décision en réécriture» = «Structures and Decision in Rewriting»Caron Bernet, Anne-Cécile; Dauchet, Max.1993, 131 p.Thesis

Descendants of a recognizable tree language for sets of linear monadic term rewrite rulesVAGVÖLGYI, Sandor.Information processing letters. 2006, Vol 99, Num 3, pp 111-118, issn 0020-0190, 8 p.Article

A characterization of Büchi tree automataSKURCZYNSKI, Jerzy.Information processing letters. 2002, Vol 81, Num 1, pp 29-33, issn 0020-0190Article

XML type checking using high-level tree transducerTOZAWA, Akihiko.Lecture notes in computer science. 2006, pp 81-96, issn 0302-9743, isbn 3-540-33438-6, 1Vol, 16 p.Conference Paper

Complexity of weak acceptance conditions in tree automataNEUMANN, Jakub; SZEPIETOWSKI, Andrzej; WALUKIEWICZ, Igor et al.Information processing letters. 2002, Vol 84, Num 4, pp 181-187, issn 0020-0190, 7 p.Article

Decidability and closure properties of equational tree languagesOHSAKI, Hitoshi; TAKAI, Toshinori.Lecture notes in computer science. 2002, pp 114-128, issn 0302-9743, isbn 3-540-43916-1, 15 p.Conference Paper

A property of left-linear rewrite systems preserving recognizabilityGYENIZSE, P; VAGVÖLGYI, S.Theoretical computer science. 2000, Vol 242, Num 1-2, pp 477-498, issn 0304-3975Article

Domains of partial attributed tree transducersFÜLÖP, Z; MANETH, S.Information processing letters. 2000, Vol 73, Num 5-6, pp 175-180, issn 0020-0190Article

Higher-order matching and tree automataCOMON, H; JURSKI, Y.Lecture notes in computer science. 1998, pp 157-176, issn 0302-9743, isbn 3-540-64570-5Conference Paper

Module checking revisitedKUPFERMAN, O; VARDI, M. Y.Lecture notes in computer science. 1997, pp 36-47, issn 0302-9743, isbn 3-540-63166-6Conference Paper

Simulating alternating tree automata by nondeterministic automata : new results and new proffs of the theorems of Rabin, McNaughton and SafraMULLER, D. E; SCHUPP, P. E.Theoretical computer science. 1995, Vol 141, Num 1-2, pp 69-107, issn 0304-3975Article

METHODES ALGEBRIQUES POUR LA VERIFICATION DES SYSTEMES INFINIS = ALGEBRICAL METHODS FOR INFINITE STATES SYSTEMS MODEL CHECKINGLabroue, Anne; Schnoebelen, Philippe.2002, 162 p.Thesis

Nondeterministic tree automataNIESSNER, Frank.Lecture notes in computer science. 2002, pp 135-152, issn 0302-9743, isbn 3-540-00388-6, 18 p.Conference Paper