Automatic structures for fundamental groupoids of graphs of groups

Paul Lunau

doi:10.1142/S0218196705002153

Automatic structures for fundamental groupoids of graphs of groups

Paul Lunau

School of Mathematical & Computer Sciences

Research output: Contribution to journal › Article › peer-review

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 language	English
Pages (from-to)	129-142
Number of pages	14
Journal	International Journal of Algebra and Computation
Volume	15
Issue number	1
DOIs	https://doi.org/10.1142/S0218196705002153
Publication status	Published - Feb 2005

Keywords

Automaticity
Graphs of groups
Groupoids

Access to Document

10.1142/S0218196705002153

Cite this

@article{1544511682b5455b8fab2af1bcdf9479,

title = "Automatic structures for fundamental groupoids of graphs of groups",

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). {\textcopyright} World Scientific Publishing Company.",

keywords = "Automaticity, Graphs of groups, Groupoids",

author = "Paul Lunau",

year = "2005",

month = feb,

doi = "10.1142/S0218196705002153",

language = "English",

volume = "15",

pages = "129--142",

journal = "International Journal of Algebra and Computation",

issn = "1793-6500",

publisher = "World Scientific Publishing",

number = "1",

}

TY - JOUR

T1 - Automatic structures for fundamental groupoids of graphs of groups

AU - Lunau, Paul

PY - 2005/2

Y1 - 2005/2

N2 - 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.

AB - 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.

KW - Automaticity

KW - Graphs of groups

KW - Groupoids

U2 - 10.1142/S0218196705002153

DO - 10.1142/S0218196705002153

M3 - Article

SN - 1793-6500

VL - 15

SP - 129

EP - 142

JO - International Journal of Algebra and Computation

JF - International Journal of Algebra and Computation

IS - 1

ER -

Automatic structures for fundamental groupoids of graphs of groups

Abstract

Keywords

Access to Document

Fingerprint

Cite this