A NOTE ON THE REPRESENTATION OF FINITE TREE AUTOMATAREISIG W.1979; INFORM. PROCESSG LETTERS; NLD; DA. 1979; VOL. 8; NO 5; PP. 239-240; BIBL. 3 REF.Article

SOME RESULTS IN TREE AUTOMATALEVY LS; JOSHI AK.1973; MATH. SYST. THEORY; U.S.A.; DA. 1973; VOL. 6; NO 4; PP. 334-342; BIBL. 10 REF.Serial Issue

A FAAUTOMATAK ALGEBRAI ELMELETE. II = THEORIE ALGEBRIQUE DES AUTOMATES ARBRES. IIGECSEG F; MAGNUS S.1976; MAT. LAPOK; HUN; DA. 1976-1979; VOL. 27; NO 3-4; PP. 283-336; BIBL. 6 P.Article

PEBBLE MACHINES AND TREE WALKING MACHINESMORIYA T.1982; INFORMATION SCIENCES (NEW YORK); ISSN 0020-0255; USA; DA. 1982; VOL. 27; NO 2; PP. 99-119; BIBL. 12 REF.Article

SYSTOLIC TREES AND SYSTOLIC LANGUAGE RECOGNITION BY TREE AUTOMATASTEINBY M.1982; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1982; VOL. 22; NO 1; PP. 219-232; BIBL. 13 REF.Article

LOGICAL COMPLEXITY OF SOME CLASSES OF TREE LANGUAGES GENERATED BY MULTIPLE-TREE-AUTOMATABUSKOWSKI W.1980; Z. MATH. LOGIK GRUNDL. MATH.; DDR; DA. 1980; VOL. 26; NO 1; PP. 41-49; BIBL. 5 REF.Article

SYSTOLIC AUTOMATA FOR VLSI ON BALANCED TREESCULIK K II; GRUSKA J; SALOMAA A et al.1983; ACTA INFORMATICA; ISSN 0001-5903; DEU; DA. 1983; VOL. 18; NO 4; PP. 335-344; BIBL. 4 REF.Article

COMPOSITION OF TOP-DOWN AND BOTTOM-UP TREE TRANSDUCTIONSBAKER BS.1979; INFORM. AND CONTROL; USA; DA. 1979; VOL. 41; NO 2; PP. 186-213; BIBL. 9 REF.Article

CONTEXT-DEPENDENT TREE AUTOMATAPYSTER A.1978; INFORM. AND CONTROL; USA; DA. 1978; VOL. 38; NO 1; PP. 81-102; BIBL. 16 REF.Article

FUZZY TREE AUTOMATA AND THEIR APPLICATIONS TO PATTERN DESCRIPTION PATTERN CLASSIFICATION, SYNTACTIC PATTERN RECOGNITION AND PATTERN RETRIEVALLEE ET.1978; CONFERENCE ON INFORMATION SCIENCES AND SYSTEMS. 12/1978-03-29/BALTIMORE; USA; BALTIMORE: JOHNS HOPKINS UNIVERSITY; DA. 1978; PP. 323-328; BIBL. 15 REF.Conference Paper

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

CONSTRAINTS ON STRUCTURAL DESCRIPTIONS: LOCAL TRANSFORMATIONS.JOSHI AK; LEVY LS.1977; S.I.A.M. J. COMPUTG; U.S.A.; DA. 1977; VOL. 6; NO 2; PP. 272-284; BIBL. 12 REF.Article

ON PUSHDOWN TREE AUTOMATAGUESSARIAN I.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 112; PP. 211-223; BIBL. 20 REF.Conference 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

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

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

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