Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-16T19:56:53.011Z Has data issue: false hasContentIssue false

GROUPS AND SEMIGROUPS WITH A ONE-COUNTER WORD PROBLEM

Published online by Cambridge University Press:  01 October 2008

DEREK F. HOLT*
Affiliation:
Mathematics Institute, University of Warwick, Coventry CV4 7AL, UK (email: D.F.Holt@warwick.ac.uk)
MATTHEW D. OWENS
Affiliation:
Mathematics Institute, University of Warwick, Coventry CV4 7AL, UK
RICHARD M. THOMAS
Affiliation:
Department of Computer Science, University of Leicester, Leicester LE1 7RH, UK (email: rmt@mcs.le.ac.uk)
*
✉For correspondence; e-mail: D.F.Holt@warwick.ac.uk
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

We prove that a finitely generated semigroup whose word problem is a one-counter language has a linear growth function. This provides us with a very strong restriction on the structure of such a semigroup, which, in particular, yields an elementary proof of a result of Herbst, that a group with a one-counter word problem is virtually cyclic. We prove also that the word problem of a group is an intersection of finitely many one-counter languages if and only if the group is virtually abelian.

Information

Type
Research Article
Copyright
Copyright © 2008 Australian Mathematical Society