The theory of invertible algorithms
Gianni Aguzzi (1981)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Displaying similar documents to “A fast algorithm to decide on the equivalence of stateless DPDA”
The theory of invertible algorithms
Analysis of algorithms for the recognition of rational and context-free trace languages
A. Avellone, M. Goldwurm (1998)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Epsilon weak precedence grammars and languages
Masoud T. Milani, David A. Workman (1990)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
The behaviour of parsing time under grammar morphisms
Hermann K.-G. Walter, Joannis Keklikoglou, Werner Kern (1978)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Finiteness results on rewriting systems
Jean-Claude Raoult (1981)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
On ambiguity in DOS systems
Andrzej Ehrenfeucht, David Haussler, Grzegorz Rozenberg (1984)
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: