论文信息 - A Geometric Characterization of Automatic Monoids

A Geometric Characterization of Automatic Monoids

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.

Pedro V. Silva | Benjamin Steinberg | B. Steinberg

[1] Mario Petrich,et al. Introduction to semigroups , 1973 .

[2] Bolyai János Matematikai Társulat,et al. Algebraic theory of semigroups , 1979 .

[3] Nikola Ruskuc,et al. Confluent Monadic String-Rewriting Systems and Automatic Structures , 2001, J. Autom. Lang. Comb..

[4] J. Howie. An introduction to semigroup theory , 1976 .

[5] David B. A. Epstein,et al. Word processing in groups , 1992 .

[6] Robert H. Gilman,et al. GROUPS WITH A RATIONAL CROSS-SECTION , 1987 .

[7] Samuel Eilenberg,et al. Automata, languages, and machines. A , 1974, Pure and applied mathematics.

[8] Gilbert Baumslag,et al. Automatic groups and amalgams , 1991 .

[9] Klaus Madlener,et al. Some Applications Of Prefix-Rewriting In Monoids, Groups, And Rings , 1998 .

[10] Friedrich Otto,et al. On S-Regular Prefix-Rewriting Systems and Automatic Structures , 1999, COCOON.

[11] Friedrich Otto,et al. Automatic Monoids Versus Monoids with Finite Convergent Presentations , 1998, RTA.

[12] Edmund F. Robertson,et al. Automatic monoids and change of generators , 1999, Mathematical Proceedings of the Cambridge Philosophical Society.

[13] Colin M. Campbell,et al. Automatic semigroups , 2001, Theor. Comput. Sci..

[14] Michael Hoffmann,et al. Automaticity and commutative semigroups , 2002, Glasgow Mathematical Journal.