Article contents
On graph products of automatic monoids
Published online by Cambridge University Press: 15 August 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.
Keywords
- Type
- Research Article
- Information
- RAIRO - Theoretical Informatics and Applications , Volume 35 , Issue 5 , September 2001 , pp. 403 - 417
- Copyright
- © EDP Sciences, 2001
References
- 6
- Cited by