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

DOI10.1007/BF01776568zbMATH Open0392.68065OpenAlexW2021745512MaRDI QIDQ4174258FDOQ4174258

Authors: 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)

Cites Work

• Title not available (Why is that?)
• Mappings and grammars on trees
• Tree generating regular systems
• Transductions des langages de Chomsky
• A generalized approach to formal languages
• Un théorème de duplication pour les forets algébriques
• Derivation-bounded languages
• Parallel context-free languages

Cited In (2)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4174258)