Right and left invertibility in -calculus
I. Margaria, M. Zacchi (1983)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Displaying similar documents to “Complexity of -term reductions”
Right and left invertibility in -calculus
Frontiers of infinite trees
Bruno Courcelle (1978)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
On a tree collision resolution algorithm in presence of capture
U. Schmid (1992)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
A theory of complexity of monadic recursion schemes
A. Ja. Dikovskii (1981)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Digital search trees with keys of variable length
Markus E. Nebel (1996)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Implementing term rewriting by jungle evaluation
Berthold Hoffmann, Detlef Plump (1991)
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: