On subword complexities of homomorphic images of languages
A. Ehrenfeucht, G. Rozenberg (1982)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Displaying similar documents to “Unavoidable languages, cuts and innocent sets of words”
On subword complexities of homomorphic images of languages
The separability of formal languages
R. Pinzani, R. Sprugnoli (1982)
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:
Languages obtained from infinite words
T. Harju, L. Ilie (1997)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Generalized cancellation-and-permutation properties, regular languages and supports of rational series
Gérard Jacob (1988)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
On the Ehrenfeucht conjecture for DOL languages
Karel Ii Culik, Juhani Karhumäki (1983)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
PCP-prime words and primality types
Alexandru Mateescu, Arto Salomaa (1993)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity: