© 2004 by Oxford University Press
| ||||||||||||||||||||||||||||||||||||||||||||||||||||
A Geometric Characterization of Automatic Monoids
1 Centro de Matemática, Faculdade de Ciências, Universidade do Porto, R. Campo Alegre, 687 4169-007 Porto, Portugal 2 School of Mathematics and Statistics, Carleton University, Ottawa, Ontario K1S 5B6, Canada
It is well known that automatic groups can be characterized using geometric properties of their Cayley graphs. Along the same line of thought, we provide a geometric characterization of automatic monoids. This involves working with a slightly strengthened definition of an automatic monoid which is still a proper generalization of the concept of an automatic group. The two definitions coincide in the case of right cancellative monoids for which a particularly simple characterization is obtained.
Received 9 May 2001. Revised 21 December 2003.
![]()
CiteULike
Connotea
Del.icio.us What's this?
This article has been cited by other articles:
![]() |
A. J. Cain CANCELLATIVITY IS UNDECIDABLE FOR AUTOMATIC SEMIGROUPS Q J Math, September 1, 2006; 57(3): 285 - 295. [Abstract] [Full Text] [PDF] |
||||
