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 “A decision method for the recognizability of sets defined by number systems”
On subword complexities of homomorphic images of languages
Languages obtained from infinite words
T. Harju, L. Ilie (1997)
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:
Two-way automaton computations
Jean-Camille Birget (1990)
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:
Unavoidable languages, cuts and innocent sets of words
L. Rosaz (1995)
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: