On semidirect and two-sided semidirect products of finite trivial monoids
F. Blanchet-Sadri (1996)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
F. Blanchet-Sadri (1996)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
F. Blanchet-Sadri (1997)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Roman R. Redziejowski (1995)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Roman König (1985)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Johannes Arz (1983)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Jürgen Avenhaus, Ronald V. Book, Craig C. Squier (1984)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Jean-Eric Pin, Pascal Weil (2001)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
In a previous paper, the authors studied the polynomial closure of a variety of languages and gave an algebraic counterpart, in terms of Mal’cev products, of this operation. They also formulated a conjecture about the algebraic counterpart of the boolean closure of the polynomial closure – this operation corresponds to passing to the upper level in any concatenation hierarchy. Although this conjecture is probably true in some particular cases, we give a counterexample in the general...