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:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “A theory of complexity of monadic recursion schemes”
Decidable subcases of the equivalence problem for recursive program schemes
Complexity of E0L structural equivalence
Kai Salomaa, Derick Wood, Sheng Yu (1995)
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:
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:
A fast algorithm to decide on the equivalence of stateless DPDA
Didier Caucal (1993)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Ogden's lemma for nonterminal bounded languages
R. Boonyavatana, G. Slutzki (1986)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity: