Skip Navigation

The Quarterly Journal of Mathematics 2004 55(3):333-356; doi:10.1093/qmath/hah006
© 2004 by Oxford University Press
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (11)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Silva, P. V.
Right arrow Articles by Steinberg, B.
Right arrow Search for Related Content
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

A Geometric Characterization of Automatic Monoids

Pedro V. Silva1 and Benjamin Steinberg2

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.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?


This article has been cited by other articles:


Home page
Q J MathHome page
A. J. Cain
CANCELLATIVITY IS UNDECIDABLE FOR AUTOMATIC SEMIGROUPS
Q J Math, September 1, 2006; 57(3): 285 - 295.
[Abstract] [Full Text] [PDF]



Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.