Continuous monoids and yields of infinite trees
M. Dauchet, E. Timmerman (1986)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Displaying similar documents to “Frontiers of infinite trees”
Continuous monoids and yields of infinite trees
Complexity of -term reductions
M. Dezani-Ciancaglini, S. Ronchi Della Rocca, L. Saitta (1979)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Strong iterative pairs and the regularity of context-free languages
A. Ehrenfeucht, G. Rozenberg (1985)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Decidable subcases of the equivalence problem for recursive program schemes
Bruno Courcelle, Jean H. Gallier (1987)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Complexity of E0L structural equivalence
Kai Salomaa, Derick Wood, Sheng Yu (1995)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Decidability of equivalence for a class of non-deterministic tree transducers
Yves André, Max Dauchet (1994)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Yield-languages recognized by alternating tree recognizers
Kai Salomaa (1988)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity: