Endomorphism monoids of free acts and 0-wreath products of monoids, I. Annihilator properties.
U. Knauer, A. Mikhalev (1980)
Semigroup forum
Similarity:
U. Knauer, A. Mikhalev (1980)
Semigroup forum
Similarity:
U. Knauer, A. Mikhalev (1980)
Semigroup forum
Similarity:
L. Skornjakov (1982)
Banach Center Publications
Similarity:
P. Dehornoy (1986-1987)
Semigroup forum
Similarity:
V. Fleischer (1988)
Semigroup forum
Similarity:
A. Veloso Da Costa (2001)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
The graph product is an operator mixing direct and free products. It is already known that free products and direct products of automatic monoids are automatic. The main aim of this paper is to prove that graph products of automatic monoids of finite geometric type are still automatic. A similar result for prefix-automatic monoids is established.
V. Fleischer (1986-1987)
Semigroup forum
Similarity:
C. Choffrut (1990)
Semigroup forum
Similarity:
Gerard Lallement (1980)
Semigroup forum
Similarity:
L.A. Skornjakov (1979)
Semigroup forum
Similarity: