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 search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “On the Ehrenfeucht conjecture for DOL languages”
On subword complexities of homomorphic images of languages
FPOL systems generating counting languages
A. Ehrenfeucht, G. Rozenberg (1981)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Comparison of basic language generating devices (non-deterministic systems)
Manfred Kudlek (1990)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
On some context free languages that are not deterministic ETOL languages
A. Ehrenfeucht, G. Rozenberg (1977)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Polynomial size test sets for commutative languages
Ismo Hakala, Juha Kortelainen (1997)
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:
Coordinated pair systems ; part I : Dyck works and classical pumping
A. Ehrenfeucht, H. J. Hoogeboom, G. Rozenberg (1986)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity: