Issue Theoret. Informatics Appl. Volume 35, Number 5, September-October 2001 Page(s) 403 - 417 DOI 10.1051/ita:2001103

DOI: 10.1051/ita:2001103


Theoret. Informatics Appl. 35, 403-417 (2001)

On graph products of automatic monoids

A. Veloso da Costa

Centro de Matemática, Universidade do Minho, 4710-057 Braga, Portugal; aveloso@math.uminho.pt.

(Received December, 2000. Accepted January, 2002.)

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.

Mathematics Subject Classification. 20M10, 68Q68.

Key words: Automatic monoid -- graph product.


© EDP Sciences 2001

What is OpenURL?