A note on the recognition of one counter languages
S. A. Greibach (1975)
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 “Pumping and pushdown machines”
A note on the recognition of one counter languages
A note on the undecidability of contextfreeness
J. Albert (1982)
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:
Indexed counter languages
J. Duske, M. Middendorf, R. Parchmann (1992)
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:
Space classes, intersection of languages and bounded erasing homomorphisms
Andreas Brandstädt (1983)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Repetitive strings are not context-free
Rockford Ross, Karl Winklmann (1982)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity: