Extensions and submonoids of automatic monoids

In this paper, submonoids and extensions of automatic and p-automatic monoids are studied. The concept of a p-automatic monoid is a variant on the usual concept of an automatic monoid designed to allow a geometric characterization analogous to the group case. In the case of right cancellative monoids, the two concepts coincide. Here, we study rational submonoids of (p-)automatic monoids, being able to show in many cases that (p-)automaticity is inherited. Our sharpest results concern rational subgroups. Also, closure properties are established for various notions of extensions of (p-)automatic monoids, including different types of products, ideal extensions, and Rees matrix constructions.

[1]  Thomas Sudkamp,et al.  Languages and Machines , 1988 .

[2]  Edmund F. Robertson,et al.  Automatic Completely-Simple Semigroups , 2002 .

[3]  Jeffrey D. Ullman,et al.  Formal languages and their relation to automata , 1969, Addison-Wesley series in computer science and information processing.

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

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

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

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

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

[9]  A. Clifford,et al.  The algebraic theory of semigroups , 1964 .

[10]  Rita Gitik.  On quasiconvex subgroups of negatively curved groups , 1997 .