Reduction algorithms for some classes of aperiodic monoids
Roman König (1985)
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.
Displaying similar documents to “On finitely generated monoids of matrices with entries in ”
Reduction algorithms for some classes of aperiodic monoids
A note on equal powers of word morphisms
K. Ruohonen (1977)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
A simple proof of Valiant's lemma
Hermann K.-G. Walter (1986)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
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:
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:
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:
A note on the iteration of infinite matrices
Wolfgang Wechler (1988)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity: