Morphismes et bimorphismes d'arbres

DOI10.1016/0304-3975(82)90098-6zbMath0486.68072OpenAlexW1964679910MaRDI QIDQ1165018

André Arnold, Max Dauchet

Publication date: 1982

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

Full work available at URL: https://doi.org/10.1016/0304-3975(82)90098-6

zbMATH Keywords

algebraic structuretree languageclasses of tree bimorphismsinverse transformation of homomorphismmagmoidsrecognizable foresttree homomorphisms

Mathematics Subject Classification ID

Trees (05C05) Formal languages and automata (68Q45) Algebraic structures (08A99)

Related Items

Compositions of constant weighted extended tree transducers ⋮ Linking theorems for tree transducers ⋮ Tree Transformations and Dependencies ⋮ Defining syntax-directed translations by tree bimorphisms ⋮ Recursively defined tree transductions ⋮ Unnamed Item ⋮ Compositions with Constant Weighted Extended Tree Transducers ⋮ Syntax-Directed Translations and Quasi-alphabetic Tree Bimorphisms ⋮ Compositions of Weighted Extended Tree Transducers — The Unambiguous Case ⋮ A complete rewriting system for a monoid of tree transformation classes ⋮ Extended Multi Bottom-Up Tree Transducers ⋮ Compositions of Tree-to-Tree Statistical Machine Translation Models ⋮ Decidability of equivalence for a class of non-deterministic tree transducers ⋮ Compositions of extended top-down tree transducers ⋮ Composition closure of linear extended top-down tree transducers ⋮ PROPERTIES OF QUASI-RELABELING TREE BIMORPHISMS ⋮ Equational tree transformations ⋮ The Power of Weighted Regularity-Preserving Multi Bottom-Up Tree Transducers ⋮ Alphabetic and synchronized tree transducers ⋮ Linear context-free tree languages and inverse homomorphisms ⋮ A Kleene Theorem for Forest Languages ⋮ Compositions of Tree-to-Tree Statistical Machine Translation Models ⋮ Equational Weighted Tree Transformations with Discounting ⋮ Survey: Weighted Extended Top-Down Tree Transducers Part III — Composition ⋮ Equational weighted tree transformations ⋮ Extended multi bottom-up tree transducers ⋮ Recognizable tree-languages and nonlinear morphisms

Cites Work

• Transductions des langages de Chomsky
• Un théorème de duplication pour les forets algébriques
• Un théorème de Chomsky-Schützenberger pour les forets algébriques
• Principal AFL
• Generalized sequential machine maps
• Sur diverses familles de langages fermées par transduction rationnelle
• The basic algebraic structures in categories of derivations
• Bottom-up and top-down tree transformations— a comparison
• Une Relation d'Equivalence Decidable sur la Classe des Forêts Reconnaissables
• Forêts Algébriques et Homomorphismes Inverses
• Context-free grammars on trees
• Tree generating regular systems
• Automata in general algebras
• Mappings and grammars on trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item