A theory of complexity of monadic recursion schemes
A. Ja. Dikovskii (1981)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Displaying similar documents to “Decidable subcases of the equivalence problem for recursive program schemes”
A theory of complexity of monadic recursion schemes
Yield-languages recognized by alternating tree recognizers
Kai Salomaa (1988)
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:
A parenthesis machine for string manipulation
Mariangiola Dezani-Ciancaglini (1974)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Frontiers of infinite trees
Bruno Courcelle (1978)
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:
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: