Strong iterative pairs and the regularity of context-free languages
A. Ehrenfeucht, G. Rozenberg (1985)
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 “Ogden's lemma for nonterminal bounded languages”
Strong iterative pairs and the regularity of context-free languages
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:
Indexed counter languages
J. Duske, M. Middendorf, R. Parchmann (1992)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
A note on the recognition of one counter languages
S. A. Greibach (1975)
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:
Yield-languages recognized by alternating tree recognizers
Kai Salomaa (1988)
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: