Algorithmische Probleme bei Einrelatorgruppen und ihre Komplexität

DOI10.1007/BF02011863zbMath0396.03040OpenAlexW1975218803MaRDI QIDQ4179012

Klaus Madlener, Jürgen Avenhaus

Publication date: 1978

Published in: Archiv für Mathematische Logik und Grundlagenforschung (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/137940

zbMATH Keywords

AlgorithmComplexityDecidabilityWord ProblemOne Relator Groups

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Word problems, etc. in computability and recursion theory (03D40) Applications of computability and recursion theory (03D80)

Related Items (5)

Thue systems as rewriting systems ⋮ Pseudo-natural algorithms for finitely generated presentations of monoids and groups ⋮ Unnamed Item ⋮ The Nielsen reduction and P-complete problems in free groups ⋮ Pseudo-natural algorithms for the word problem for finitely presented monoids and groups

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The word problem and power problem in 1-relator groups are primitive recursive
• Certain subgroups of groups with a single defining relation
• On one relator groups and HNN extensions
• Some results on one-relator groups

This page was built for publication: Algorithmische Probleme bei Einrelatorgruppen und ihre Komplexität