Une Relation d'Equivalence Decidable sur la Classe des Forêts Reconnaissables

DOI10.1007/BF01776568zbMath0392.68065OpenAlexW2021745512MaRDI QIDQ4174258

Max Dauchet, André Arnold

Publication date: 1978

Published in: Mathematical Systems Theory (Search for Journal in Brave)

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

zbMATH Keywords

Formal LanguageEquivalence RelationRational TransductionRecognizable Sets of TreesTree-Homomorphisms

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

Object grammars and bijections. ⋮ Morphismes et bimorphismes d'arbres

Cites Work

• Unnamed Item
• Transductions des langages de Chomsky
• Un théorème de duplication pour les forets algébriques
• A generalized approach to formal languages
• Derivation-bounded languages
• Parallel context-free languages
• Tree generating regular systems
• Mappings and grammars on trees

This page was built for publication: Une Relation d'Equivalence Decidable sur la Classe des Forêts Reconnaissables