Comparison of basic language generating devices (non-deterministic systems)
Manfred Kudlek (1990)
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 “Classes of languages proof against regular pumping”
Comparison of basic language generating devices (non-deterministic systems)
The strong independence of substitution and homomorphic replication
S. A. Greibach (1978)
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:
FPOL systems generating counting languages
A. Ehrenfeucht, G. Rozenberg (1981)
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:
On subword complexities of homomorphic images of languages
A. Ehrenfeucht, G. Rozenberg (1982)
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: