FPOL systems generating counting languages
A. Ehrenfeucht, G. Rozenberg (1981)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Displaying similar documents to “Generalized cancellation-and-permutation properties, regular languages and supports of rational series”
FPOL systems generating counting languages
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:
On subword complexities of homomorphic images of languages
A. Ehrenfeucht, G. Rozenberg (1982)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Classes of languages proof against regular pumping
R. Sommerhalder (1980)
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:
PCP-prime words and primality types
Alexandru Mateescu, Arto Salomaa (1993)
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: