Languages obtained from infinite words
T. Harju, L. Ilie (1997)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Displaying similar documents to “The pseudovariety is hyperdecidable”
Languages obtained from infinite words
Decomposing a -valued transducer into unambiguous ones
Andreas Weber (1996)
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:
On free inverse monoid languages
Pedro V. Silva (1996)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
The topologies of sofic subshifts have computable Pierce invariants
Tom Head (1991)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Shuffle binoids
S. L. Bloom, Z. Ésik (1998)
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: