Abstract
It is shown that the graph product of automatic monoids is always automatic thereby improving on a result by Veloso da Costa [22] who showed this result provided the factors have finite geometric type. Secondly, we prove that, in general, the free product (and therefore the graph product) of biautomatic monoids need not be biautomatic. Imposing a restriction on the factors that is symmetric to Veloso da Costa's "finite geometric type", the biautomaticity of all graph products of biautomatic monoids is shown.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
