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

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

Infinitary tree languages recognized by ω-automataSAOUDI, A.Information processing letters. 1984, Vol 18, Num 1, pp 15-19, issn 0020-0190Article

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

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

Inference of tree automata from sample set of treesFUKUDA, H; KAMATA, K.International journal of computer & information sciences. 1984, Vol 13, Num 3, pp 177-196, issn 0091-7036Article

Tree automata and attribute grammarsKAMIMURA, T.Information and control. 1983, Vol 67, Num 1, pp 1-21, issn 0019-9958Article

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

Pushdown tree automataGUESSARIAN, I.Mathematical systems theory. 1983, Vol 16, Num 4, pp 237-263, issn 0025-5661Article

Minimizing tree automata for unranked treesMARTENS, Wim; NIEHREN, Joachim.Lecture notes in computer science. 2005, pp 232-246, issn 0302-9743, isbn 3-540-30951-9, 1Vol, 15 p.Conference Paper

Tree-walking automata cannot be determinizedBOJANCZYK, Mikolaj; COLCOMBET, Thomas.Lecture notes in computer science. 2004, pp 246-256, issn 0302-9743, isbn 3-540-22849-7, 11 p.Conference Paper

XML to relational conversion using theory of regular tree grammarsMANI, Murali; DONGWON LEE.Lecture notes in computer science. 2003, pp 81-103, issn 0302-9743, isbn 3-540-00736-9, 23 p.Conference Paper

Iterated relabeling tree transducersFÜLÖP, Z; TERLUTTE, A.Theoretical computer science. 2002, Vol 276, Num 1-2, pp 221-244, issn 0304-3975Article

Monadic second-order logic on tree-like structuresWALUKIEWICZ, Igor.Theoretical computer science. 2002, Vol 275, Num 1-2, pp 311-346, issn 0304-3975Article

Information extraction in structured documents using tree automata inductionKOSALA, Raymond; VAN DEN BUSSCHE, Jan; BRUYNOOGHE, Maurice et al.Lecture notes in computer science. 2002, pp 299-310, issn 0302-9743, isbn 3-540-44037-2, 12 p.Conference Paper

Regularly extended two-way nondeterministic tree automataBRÜGGEMANN-KLEIN, Anne; WOOD, Derick.Lecture notes in computer science. 2001, pp 57-66, issn 0302-9743, isbn 3-540-42491-1Conference Paper

Rewrite closure for ground and cancellative AC theoriesTIWARI, Ashish.Lecture notes in computer science. 2001, pp 334-346, issn 0302-9743, isbn 3-540-43002-4Conference Paper