Hostname: page-component-586b7cd67f-t8hqh Total loading time: 0 Render date: 2024-12-01T18:23:13.419Z Has data issue: false hasContentIssue false

Automatic monoids and change of generators

Published online by Cambridge University Press:  01 November 1999

A. J. DUNCAN
Affiliation:
School of Mathematics and Statistics, University of Newcastle, Newcastle upon Tyne NE1 7RU; e-mail: a.duncan@ncl.ac.uk
E. F. ROBERTSON
Affiliation:
School of Mathematical and Computational Sciences, Mathematical Institute, University of St Andrews, The North Haugh, St Andrews, Fife KY16 9SS; e-mail: edmund@dcs.st-and.ac.uk, e-mail: nik@dcs.st-and.ac.uk
N. RUšKUC
Affiliation:
School of Mathematical and Computational Sciences, Mathematical Institute, University of St Andrews, The North Haugh, St Andrews, Fife KY16 9SS; e-mail: edmund@dcs.st-and.ac.uk, e-mail: nik@dcs.st-and.ac.uk

Abstract

The main result of this paper establishes invariance under change of generators for automatic structures for monoids (a property that is well known to hold for automatic groups but fails for semigroups). This result is then applied to show that if a free product of two monoids is automatic, then so are both the free factors. Finally, the difference between automatic structures, in terms of monoid generating sets and semigroup generating sets, is discussed.

Type
Research Article
Copyright
© The Cambridge Philosophical Society 1999

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)