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 - Informatique Th\'eorique et Applications}, volume = {35}, year = {2001}, pages = {403-417}, mrnumber = {1908863}, zbl = {1019.20028}, language = {en}, url = {http://dml.mathdoc.fr/item/ITA_2001__35_5_403_0} }
Veloso Da Costa, A. On graph products of automatic monoids. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 35 (2001) pp. 403-417. http://gdmltest.u-ga.fr/item/ITA_2001__35_5_403_0/
[1] Automatic Semigroups. Theoret. Comput. Sci. (to appear). | MR 1795250 | Zbl 0987.20033
, , and ,[2] Automatic monoids and change of generators. Math. Proc. Cambridge Philos. Soc. 127 (1999) 403-409. | MR 1713118 | Zbl 0941.20065
, and ,[3] Graph Products of Groups, Ph.D. Thesis. The University of Leeds (1990).
,[4] Introduction to Automata Theory, Languages and Computation. Addison-Wesley (1979). | MR 645539 | Zbl 0426.68001
and ,[5] Algorithms and Geometry for Graph Products of Groups. J. Algebra 171 (1995) 230-257. | MR 1314099 | Zbl 0831.20032
and ,[6] An Introduction to Semigroup Theory. Academic Press (1976). | MR 466355 | Zbl 0355.20056
,[7] A Geometric Characterization of Automatic Monoids. Universidade do Porto (preprint). | MR 2082097 | Zbl 1076.20041
and ,[8] Extensions and Submonoids of Automatic Monoids. Universidade do Porto (preprint). | MR 1932918 | Zbl 1061.20048
and ,[9] Graph Products of Monoids. Semigroup Forum 63 (2001) 247-277. | MR 1830687 | Zbl 0992.20042
,