PCP-prime words and primality types
Alexandru Mateescu, Arto Salomaa (1993)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Displaying similar documents to “Separating words with machines and groups”
PCP-prime words and primality types
A decision method for the recognizability of sets defined by number systems
Juha Honkala (1986)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
On a class of infinite words with bounded repetitions
Anton Černý (1985)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
The relation of two patterns with comparable languages patterns
Gilberto Filé (1989)
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:
Detecting the morphic images of a word : improving the general algorithm
Jean Néraud (1997)
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: