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

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

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

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

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

Tree pushdown automataSCHIMPF, K. M; GALLIER, J. H.Journal of computer and system sciences (Print). 1985, Vol 30, Num 1, pp 25-40, issn 0022-0000Article

The decision problem for branching time logicGUREVICH, Y; SHELAH, S.The Journal of symbolic logic. 1985, Vol 50, Num 3, pp 668-681, issn 0022-4812Article

Closure properties of the family of languages defined by systolic tree automataPARDUBSKA, D.Computers and artificial intelligence. 1988, Vol 7, Num 1, pp 59-64, issn 0232-0274Article

TREE TRANSDUCERS, L SYSTEMS, AND TWO-WAY MACHINESENGELFRIET J; ROZENBERG G; SLUTZKI G et al.1980; J. COMPUTER SYST. SCI.; USA; DA. 1980; VOL. 20; NO 2; PP. 150-202; BIBL. 66 REF.Conference Paper

Alternating automata with start formulasMOSTOWSKI, A. W.Information processing letters. 1990, Vol 35, Num 6, pp 287-290, issn 0020-0190, 4 p.Article

Top-down tree transducers with deterministic top-down look-aheadFULOP, Z; VAGVOLGYI, S.Information processing letters. 1989, Vol 33, Num 1, pp 3-5, issn 0020-0190Article

Inference of tree grammars using negative samplesBARRERO, A.Pattern recognition. 1991, Vol 24, Num 1, pp 1-8, issn 0031-3203, 8 p.Article

Deciding equivalence of finite tree automataSEIDL, H.SIAM journal on computing (Print). 1990, Vol 19, Num 3, pp 424-437, issn 0097-5397, 14 p.Article

K-Σ-treeautomata and their relation to weighted context-free grammarsTSOMOKOS, I.International journal of computer mathematics. 1989, Vol 26, Num 2, pp 91-99, issn 0020-7160Article

Deterministic tree pushdown automata and monadic tree rewriting systemsSALOMAA, K.Journal of computer and system sciences (Print). 1988, Vol 37, Num 3, pp 367-394, issn 0022-0000Article

Uniform inevitability is tree automation ineffableEMERSON, E. A.Information processing letters. 1987, Vol 24, Num 2, pp 77-79, issn 0020-0190Article

A tree system approach for fingerprint pattern regonitionMOAYER, B; KING-SUN FU.IEEE transactions on pattern analysis and machine intelligence. 1986, Vol 8, Num 3, pp 376-387, issn 0162-8828Article

Logical definability of fixed pointsARNOLD, A.Theoretical computer science. 1988, Vol 61, Num 2-3, pp 289-297, issn 0304-3975Article

Unranked tree languagesBARRERO, A.Pattern recognition. 1991, Vol 24, Num 1, pp 9-18, issn 0031-3203, 10 p.Article

On iterative and cellular tree arraysIBARRA, O. H; TAO TIANG; CHANG, J. H et al.Journal of computer and system sciences (Print). 1989, Vol 38, Num 3, pp 452-473, issn 0022-0000Article