Groups with a Recursively Enumerable Irreducible Word Problem

DOI10.1007/978-3-642-40164-0_27zbMATH Open1391.20024OpenAlexW72426084MaRDI QIDQ2842792

Richard M. Thomas, Gabriela Asli Rino Nesin

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 graphword problemrecursively enumerablerecursiveirreducible word problem

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

Title not available (Why is that?) ⋮ GROUPS WITH CONTEXT-FREE CO-WORD PROBLEM ⋮ GROUPS WITH CONTEXT-FREE REDUCED WORD PROBLEM

Recommendations

• Solvability of the word problem for certain groups 👍 👎
• A finitely presented orderable group with insoluble word problem 👍 👎
• GROUPS WITH CONTEXT-FREE REDUCED WORD PROBLEM 👍 👎
• On the word problem for groups defined by periodic relations 👍 👎
• The word problem and the isomorphism problem for groups 👍 👎
• GROUPS AND SEMIGROUPS WITH A ONE-COUNTER WORD PROBLEM 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

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)