Alphabetic tree relations

DOI10.1016/0304-3975(92)90348-JzbMath0765.68068MaRDI QIDQ1193896

Symeon Bozapalidis

Publication date: 27 September 1992

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

tree transformationstree languagesbimorphisms

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (10)

Defining syntax-directed translations by tree bimorphisms ⋮ The equivalence problem for letter-to-letter bottom-up tree transducers is solvable ⋮ Syntax-Directed Translations and Quasi-alphabetic Tree Bimorphisms ⋮ Decidability of equivalence for a class of non-deterministic tree transducers ⋮ PROPERTIES OF QUASI-RELABELING TREE BIMORPHISMS ⋮ Equational tree transformations ⋮ Alphabetic and synchronized tree transducers ⋮ A Survey on Decidable Equivalence Problems for Tree Transducers ⋮ Context-free series on trees ⋮ On two families of forests

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A representation of trees by languages. II
• IO and OI. I
• Generalized sequential machine maps
• Sur une classe de transformations d'arbres
• Actions, finite state sets and applications to trees
• Bottom-up and top-down tree transformations— a comparison
• Tree transducers and tree languages
• Forêts Algébriques et Homomorphismes Inverses
• Generalized finite automata theory with an application to a decision problem of second-order logic
• Mappings and grammars on trees

This page was built for publication: Alphabetic tree relations