A pumping theorem for deterministic ETOL languages
A. Ehrenfeucht, G. Rozenberg (1975)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Displaying similar documents to “Computing grammars and context-sensitive languages”
A pumping theorem for deterministic ETOL languages
Computing of graphs of relations using generative grammars
Dan A. Simovici (1980)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
The independence of certain operations on semiAFLs
Ronald V. Book, Sheila A. Greibach (1978)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
On some context free languages that are not deterministic ETOL languages
A. Ehrenfeucht, G. Rozenberg (1977)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
On languages satisfying “interchange Lemma”
Victor Mitrana (1993)
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 family of languages satisfying Bar-Hillel's lemma
Sándor Horváth (1978)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity: