On languages satisfying Ogden's lemma
L. Boasson, S. Horváth (1978)
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 “The family of languages satisfying Bar-Hillel's lemma”
On languages satisfying Ogden's lemma
A note on the undecidability of contextfreeness
J. Albert (1982)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Indexed counter languages
J. Duske, M. Middendorf, R. Parchmann (1992)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Pumping and pushdown machines
Kai Salomaa, D. Wood, Sheng Yu (1994)
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:
Algebraic caractérisations of NTIME and NTIME
Hans-Jürgen Stenger (1984)
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: