On graph products of automatic monoids
Open Access
- 1 September 2001
- journal article
- Published by EDP Sciences in RAIRO - Theoretical Informatics and Applications
- Vol. 35 (5) , 403-417
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.Keywords
This publication has 5 references indexed in Scilit:
- Extensions and submonoids of automatic monoidsTheoretical Computer Science, 2002
- Graph products of monoidsSemigroup Forum, 2001
- Automatic semigroupsTheoretical Computer Science, 2001
- Automatic monoids and change of generatorsMathematical Proceedings of the Cambridge Philosophical Society, 1999
- Algorithms and Geometry for Graph Products of GroupsJournal of Algebra, 1995