A family of groups with nice word problems

DOI10.1017/S144678870001805XzbMath0304.02018OpenAlexW2029477128MaRDI QIDQ4058659

Verena Huber-Dyson

Publication date: 1974

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

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

Mathematics Subject Classification ID

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 (7)

Obstruction to a Higman embedding theorem for residually finite groups with solvable word problem ⋮ Unnamed Item ⋮ Algorithmically complex residually finite groups ⋮ ON GENERATION OF WREATH PRODUCTS OF CYCLIC GROUPS BY TWO STATE TIME VARYING MEALY AUTOMATA ⋮ An uncountable family of finitely generated residually finite groups ⋮ Computability of finite quotients of finitely generated groups ⋮ On the virtual and residual properties of a generalization of Bestvina-Brady groups

Cites Work

• Subgroups of finitely presented groups

This page was built for publication: A family of groups with nice word problems