Groups with a Recursively Enumerable Irreducible Word Problem

DOI10.1007/978-3-642-40164-0_27MaRDI QIDQ2842792zbMATH OpenOpenAlexFDO

Authors Gabriela Asli Rino Nesin, Richard M. Thomas

Publication date 16 August 2013

Published in Fundamentals of Computation Theory (Search for Journal in Brave)

Full work available at URL https://cris.brighton.ac.uk/ws/files/493493/FCT_2013_submission_37.pdf

zbMATH Keywords

Cayley graphirreducible word problemrecursiverecursively enumerableword problem

Mathematics Subject Classification ID

Word problems, etc. in computability and recursion theory (03D40) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Recommendations

• GROUPS WITH CONTEXT-FREE REDUCED WORD PROBLEM
• scientific article; zbMATH DE number 3695456
• Context-free irreducible word problems in groups.
• Solvability of the word problem for certain groups
• The word problem and the isomorphism problem for groups
• A finitely presented orderable group with insoluble word problem
• scientific article; zbMATH DE number 5155120
• On the word problem for groups defined by periodic relations
• GROUPS AND SEMIGROUPS WITH A ONE-COUNTER WORD PROBLEM
• scientific article; zbMATH DE number 4038072

Cited in

(4)

• Recursive functions in group theory
• GROUPS WITH CONTEXT-FREE REDUCED WORD PROBLEM
• scientific article; zbMATH DE number 5155120 (Why is no real title available?)
• GROUPS WITH CONTEXT-FREE CO-WORD PROBLEM

This page was built for publication: Groups with a Recursively Enumerable Irreducible Word Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2842792)