Automatic structures for fundamental groupoids of graphs of groups

Paul Lunau

Research output: Contribution to journalArticle

Abstract

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 [1] for a free product with amalgamation to be automatic (resp. asynchronously automatic). © World Scientific Publishing Company.

Original languageEnglish
Pages (from-to)129-142
Number of pages14
JournalInternational Journal of Algebra and Computation
Volume15
Issue number1
DOIs
Publication statusPublished - Feb 2005

Keywords

  • Automaticity
  • Graphs of groups
  • Groupoids

Fingerprint Dive into the research topics of 'Automatic structures for fundamental groupoids of graphs of groups'. Together they form a unique fingerprint.

  • Cite this