On two families of forests

DOI10.1007/BF01218405zbMath0790.68055OpenAlexW2081386906MaRDI QIDQ1323385

George Rahonis, Symeon Bozapalidis

Publication date: 2 June 1994

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01218405

zbMATH Keywords

sheavestree-automataalphabetic conealphabetic tree transductionsfamily of forests

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Alphabetic and synchronized tree transducers, Principal abstract families of weighted tree languages

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Effective construction of the syntactic algebra of a recognizable series on trees
• Weighted grammars and Kleene's theorem
• Recognizable formal power series on trees
• Alphabetic tree relations
• A generalized approach to formal languages
• Un théorème de Chomsky-Schützenberger pour les forets algébriques
• Représentations matricielles des séries d'arbre reconnaissables
• Pushdown tree automata
• Une propri\'et\'e des forêts alg\'ebriques « de greibach \ra
• Bottom-up and top-down tree transformations— a comparison
• Forêts Algébriques et Homomorphismes Inverses
• Indexed Grammars—An Extension of Context-Free Grammars
• Studies in abstract families of languages
• Generalized finite automata theory with an application to a decision problem of second-order logic
• Mappings and grammars on trees