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:
Displaying similar documents to “Reduction algorithms for some classes of aperiodic monoids”
An extension of the notions of traces and of asynchronous automata
Elementariness of a finite set of words is co-NP-complete
Jean Neraud (1990)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
On the semidirect product of the pseudovariety of semilattices by a locally finite pseudovariety of groups
F. Blanchet-Sadri (1997)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
The intersection problem for alphabetic vector monoids
T. Harju, N. W. Keesmaat, H. C. M. Kleijn (1994)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Finiteness results on rewriting systems
Jean-Claude Raoult (1981)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Commutativity in groups presented by finite Church-Rosser Thue systems
Klaus Madlener, Friedrich Otto (1988)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
The decidability of the equivalence problem for polynomially bounded DOL sequences
Juhani Karhumäki (1977)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity: