We give sufficient conditions for the fundamental groupoid of a graph of groups to be automatic (resp. asynchronously automatic). These conditions are similar to those in  for a free product with amalgamation to be automatic (resp. asynchronously automatic). © World Scientific Publishing Company.
|Number of pages||14|
|Journal||International Journal of Algebra and Computation|
|Publication status||Published - Feb 2005|
- Graphs of groups