Abstract
We define, on the class of recognizable sets of trees, a relation ↔ byF 1↔F 2 if and only ifF 1 andF 2 are the images by two linear, complete and strict tree-homomorphisms of the same recognizable set of trees. We show that this relation is an equivalence relation and that it is decidable for any pair of recognizable sets whetherF 1↔F 2.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
A. Arnold et M. Dauchet, Transductions de forêts reconnaissables monadiques. Forêts corégulièresRAIRO Inf. Th.,10, 5–28 (1976).
A. Arnold et M. Dauchet, Un théorème de duplication pour les forêts algébriques,J. Comput. System Sci.,13, 223–244 (1976).
A. Arnold et M. Dauchet, Bitransductions de forêts,Automata, Languages and Programming, 3rd Colloquium, Edinburgh, 74–86 (1976).
W. S. Brainerd, Tree Generating Regular Systems,Inform. Contr.,14, 217–231 (1969).
S. Ginsburg,Algebraic and Automata Theoretic Properties of Formal Languages. North Holland, 1975.
S. Ginsburg and E. H. Spanier, Derivation—bounded languages,J. Comput. System Sci.,2, 228–250 (1968).
T. S. E. Maibaum, A generalized approach to formal languages,J. Comput. System Sci. 8, 402–432 (1974).
M. Nivat, Transductions de langages de Chomsky, These d'Etat, Paris (1968).
W. C. Rounds, Mappings and grammars on trees,Math. Systems Theory 4, 257–287 (1970).
S. Skyum, Parallel context-free languages,Inform. Contr. 26, 280–285 (1974).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Arnold, A., Dauchet, M. Une Relation d'Equivalence Decidable sur la Classe des Forêts Reconnaissables. Math. Systems Theory 12, 103–128 (1978). https://doi.org/10.1007/BF01776568
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01776568