Languages obtained from infinite words
T. Harju, L. Ilie (1997)
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.
Displaying similar documents to “Undecidability of the equivalence of finite substitutions on regular language”
Languages obtained from infinite words
Fair expressions and regular languages over lists
L. Breveglieri (1997)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
The strong independence of substitution and homomorphic replication
S. A. Greibach (1978)
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:
On languages satisfying “interchange Lemma”
Victor Mitrana (1993)
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 subword complexities of homomorphic images of languages
A. Ehrenfeucht, G. Rozenberg (1982)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity: