On some algorithmic problems for groups and monoids

DOI10.1007/978-3-662-21551-7_22OpenAlexW1573687423MaRDI QIDQ5055802FDOQ5055802

Authors: Sergey I. Adian 

Publication date: 9 December 2022

Published in: Rewriting Techniques and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-21551-7_22

Recommendations

• On the solvability of word problem by Adian graphs.
• scientific article; zbMATH DE number 3875525
• The isomorphism problem for residually torsion-free nilpotent groups.
• Dehn's Algorithm and the Complexity of Word Problems
• scientific article; zbMATH DE number 1535398

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Recursive unsolvability of a problem of Thue
• DECIDABILITY OF THE UNIVERSAL AND POSITIVE THEORIES OF A FREE GROUP
• The word problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• ON SYSTEMS OF EQUATIONS IN A FREE GROUP
• Recursive unsolvability of group theoretic problems
• Equations in Free Groups
• Concatenation as a basis for arithmetic
• Das Identitätsproblem für Gruppen mit einer definierenden Relation
• Title not available (Why is that?)
• Title not available (Why is that?)
• The word problem for one-relator semigroups
• Title not available (Why is that?)
• Title not available (Why is that?)
• On Dehn's algorithm
• Title not available (Why is that?)
• Title not available (Why is that?)
• Conjugacy in special monoids
• Applying rewriting methods to special monoids
• Recursively enumerable degress and the conjugacy problem
• Thue systems as rewriting systems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Investigations on algorithmic questions of algebra
• A Short Proof of a Theorem of Adjan
• ON THE CONJUGACY PROBLEM FOR ONE-RELATOR MONOIDS WITH ELEMENTS OF FINITE ORDER
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (3)

• Title not available (Why is that?)
• The word problem for one-relation monoids: a survey
• Title not available (Why is that?)

This page was built for publication: On some algorithmic problems for groups and monoids

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