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.
@article{ITA_2001__35_5_403_0,
author = {Veloso Da Costa, A.},
title = {On graph products of automatic monoids},
journal = {RAIRO. Theoretical Informatics and Applications},
pages = {403--417},
year = {2001},
publisher = {EDP-Sciences},
volume = {35},
number = {5},
mrnumber = {1908863},
zbl = {1019.20028},
language = {en},
url = {https://www.numdam.org/item/ITA_2001__35_5_403_0/}
}
Veloso Da Costa, A. On graph products of automatic monoids. RAIRO. Theoretical Informatics and Applications, Tome 35 (2001) no. 5, pp. 403-417. https://www.numdam.org/item/ITA_2001__35_5_403_0/
[1] ,, and, Automatic Semigroups. Theoret. Comput. Sci. (to appear). | Zbl | MR
[2] , and, Automatic monoids and change of generators. Math. Proc. Cambridge Philos. Soc. 127 (1999) 403-409. | Zbl | MR
[3] , Graph Products of Groups, Ph.D. Thesis. The University of Leeds (1990).
[4] and, Introduction to Automata Theory, Languages and Computation. Addison-Wesley (1979). | Zbl | MR
[5] and, Algorithms and Geometry for Graph Products of Groups. J. Algebra 171 (1995) 230-257. | Zbl | MR
[6] , An Introduction to Semigroup Theory. Academic Press (1976). | Zbl | MR
[7] and, A Geometric Characterization of Automatic Monoids. Universidade do Porto (preprint). | Zbl | MR
[8] and, Extensions and Submonoids of Automatic Monoids. Universidade do Porto (preprint). | Zbl | MR
[9] , Graph Products of Monoids. Semigroup Forum 63 (2001) 247-277. | Zbl | MR





