On some algorithmic problems for groups and monoids

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

S. I. Adyan

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

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

The word problem for one-relation monoids: a survey

Cites Work

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

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