A note on the undecidability of contextfreeness
J. Albert (1982)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Displaying similar documents to “A characterization of poly-slender context-free languages”
A note on the undecidability of contextfreeness
On simple representations of language families
K. Culik II, H. A. Maurer (1979)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Fair expressions and regular languages over lists
L. Breveglieri (1997)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Some consequences of a result of Ehrenfeucht and Rozenberg
Gheorghe PăUN (1980)
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:
On languages satisfying “interchange Lemma”
Victor Mitrana (1993)
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: