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:
Displaying similar documents to “On languages satisfying Ogden's lemma”
The family of languages satisfying Bar-Hillel's lemma
A note on the undecidability of contextfreeness
J. Albert (1982)
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:
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 simple representations of language families
K. Culik II, H. A. Maurer (1979)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
On the hierarchy of Petri net languages
Matthias Jantzen (1979)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity: