GROUPS WITH CONTEXT-FREE REDUCED WORD PROBLEM

DOI10.1081/AGB-120004481zbMath1012.20027OpenAlexW2033257560MaRDI QIDQ3146308

Richard M. Thomas, Duncan W. Parkes

Publication date: 5 November 2002

Published in: Communications in Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1081/agb-120004481

zbMATH Keywords

finitely generated groupsgenerating setscontext-free word problemirreducible word problemrecursively enumerable word problemreduced word problem

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Generators, relations, and presentations of groups (20F05) Automata and formal grammars in connection with logical questions (03D05) Semigroups in automata theory, linguistics, etc. (20M35) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Related Items (3)

Word problems of groups: formal languages, characterizations and decidability ⋮ Space Complexity and Word Problems of Groups ⋮ Groups whose word problems are not semilinear

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Groups, the theory of ends, and context-free languages
• About the descriptive power of certain classes of finite string-rewriting systems
• The accessibility of finitely presented groups
• The theory of ends, pushdown automata, and second-order logic
• Group presentations, formal languages and characterizations of one- counter groups

This page was built for publication: GROUPS WITH CONTEXT-FREE REDUCED WORD PROBLEM