Skip to main content
Article thumbnail
Location of Repository

Groups and semigroups with a one-counter word problem

By Derek F. Holt, Matthew D. Owens and R. M. Thomas


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

Topics: QA
Publisher: Cambridge University Press
Year: 2008
OAI identifier:

Suggested articles


  1. (1972). Certain algorithmic problems for groups and context-free languages’, doi
  2. (1979). Transductions and Context-Free Languages (Teubner, doi
  3. (2004). Word hyperbolic semigroups’, doi
  4. (1985). The accessibility of finitely presented groups’, doi
  5. (2006). On groups and counter automata, arXiv:math/0611188v1, doi
  6. (1992). Word Processing in Groups (Jones and Bartlett,
  7. (1981). Groups of polynomial growth and expanding maps’, doi
  8. (1991). On a subclass of context-free groups’,
  9. (1993). Group presentations, formal languages and characterizations of one-counter groups’, doi
  10. (2005). Groups with a context-free co-word problem’, doi
  11. (1971). Groupes et semi-groupes ` a croissance lin´ eaire’,
  12. (1983). Groups, the theory of ends, and context-free languages’, doi
  13. (1954). Groups covered by permutable subsets’, doi
  14. (1961). Language-generating devices’,
  15. (1971). Group Theory and Three-Dimensional Manifolds,
  16. (1984). An effective bound for groups of linear growth’, doi

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.