Hostname: page-component-8448b6f56d-mp689 Total loading time: 0 Render date: 2024-04-24T00:44:04.767Z Has data issue: false hasContentIssue false

On graph products of automatic monoids

Published online by Cambridge University Press:  15 August 2002

A. Veloso da Costa*
Affiliation:
Centro de Matemática, Universidade do Minho, 4710-057 Braga, Portugal; aveloso@math.uminho.pt.
Get access

Abstract

The graph product is an operator mixing direct and free products. It is already known that free products and direct products of automatic monoids are automatic. The main aim of this paper is to prove that graph products of automatic monoids of finite geometric type are still automatic. A similar result for prefix-automatic monoids is established.

Type
Research Article
Copyright
© EDP Sciences, 2001

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.)

References

C.M. Campbell, E.F. Robertson, N. Ruskuc and R.M. Thomas, Automatic Semigroups. Theoret. Comput. Sci. (to appear).
Duncan, A.J., Robertson, E.F. and Ruskuc, N., Automatic monoids and change of generators. Math. Proc. Cambridge Philos. Soc. 127 (1999) 403-409. CrossRef
E.R. Green, Graph Products of Groups, Ph.D. Thesis. The University of Leeds (1990).
J.E. Hopcroft and J.D. Ullman, Introduction to Automata Theory, Languages and Computation. Addison-Wesley (1979).
Hermiller, S. and Meier, J., Algorithms and Geometry for Graph Products of Groups. J. Algebra 171 (1995) 230-257. CrossRef
J.M. Howie, An Introduction to Semigroup Theory. Academic Press (1976).
P.V. Silva and B. Steinberg, A Geometric Characterization of Automatic Monoids. Universidade do Porto (preprint).
P.V. Silva and B. Steinberg, Extensions and Submonoids of Automatic Monoids. Universidade do Porto (preprint).
Veloso da, A. Costa, Graph Products of Monoids. Semigroup Forum 63 (2001) 247-277.