Finiteness results on rewriting systems
Jean-Claude Raoult (1981)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Displaying similar documents to “A semigroup characterization of dot-depth one languages”
Finiteness results on rewriting systems
An extension of the notions of traces and of asynchronous automata
A. Arnold (1991)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
The pseudovariety is hyperdecidable
J. Almeida, M. Zeitoun (1997)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
FPOL systems generating counting languages
A. Ehrenfeucht, G. Rozenberg (1981)
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:
The strong independence of substitution and homomorphic replication
S. A. Greibach (1978)
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: