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:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Independent instances for some undecidable problems”
The family of languages satisfying Bar-Hillel's lemma
On languages satisfying Ogden's lemma
L. Boasson, S. Horváth (1978)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Normal forms for phrase-structure grammars
Viliam Geffert (1991)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
There is no complete axiom system for shuffle expressions
A. Szepietowski (1999)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
A parenthesis machine for string manipulation
Mariangiola Dezani-Ciancaglini (1974)
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:
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: