A note on the paper “disjunctive languages and compatible orders”
M. Ito (1991)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Displaying similar documents to “Disjunctive languages and compatible orders”
A note on the paper “disjunctive languages and compatible orders”
On simple representations of language families
K. Culik II, H. A. Maurer (1979)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Rebootable and suffix-closed -power languages
B. Le Saëc, I. Litovsky (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:
A note on the undecidability of contextfreeness
J. Albert (1982)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Hierarchies of aperiodic languages
Janusz A. Brzozowski (1976)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
The separability of formal languages
R. Pinzani, R. Sprugnoli (1982)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity: