RAIRO-Theor. Inf. Appl.
Volume 35, Number 5, September October 2001
|Page(s)||403 - 417|
|Published online||15 August 2002|
On graph products of automatic monoids
Matemática, Universidade do Minho,
4710-057 Braga, Portugal; firstname.lastname@example.org.
Accepted: January 2002
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
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.