GROUPS AND SEMIGROUPS WITH A ONE-COUNTER WORD PROBLEM

DOI10.1017/S1446788708000864zbMath1180.20048OpenAlexW2129945171MaRDI QIDQ5322915

Derek F. Holt, Matthew Dylan Owens, Richard M. Thomas

Publication date: 23 July 2009

Published in: Journal of the Australian Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s1446788708000864

zbMATH Keywords

word problemgrowth functionsfinitely generated semigroupsone-counter languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Word problems, etc. in computability and recursion theory (03D40)

Related Items (11)

Word problems of groups: formal languages, characterizations and decidability ⋮ The (nested) word problem ⋮ Groups whose word problems are accepted by abelian \(G\)-automata ⋮ On the word problem for weakly compressible monoids ⋮ On the word problem for free products of semigroups and monoids ⋮ Algebras of linear growth and the dynamical Mordell-Lang conjecture ⋮ A language hierarchy of binary relations ⋮ Groups whose word problems are not semilinear ⋮ Embeddings into Thompson's group V and coCF groups ⋮ Groups Whose Word Problem is a Petri Net Language ⋮ Anisimov's Theorem for inverse semigroups

Cites Work

• Groups, the theory of ends, and context-free languages
• An effective bound for groups of linear growth
• The accessibility of finitely presented groups
• Groups of polynomial growth and expanding maps. Appendix by Jacques Tits
• Group presentations, formal languages and characterizations of one- counter groups
• Word hyperbolic semigroups
• GROUPS WITH CONTEXT-FREE CO-WORD PROBLEM
• Groups Covered By Permutable Subsets
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: GROUPS AND SEMIGROUPS WITH A ONE-COUNTER WORD PROBLEM