Complexity of word problems for HNN-extensions

DOI10.1007/978-3-030-86593-1_26OpenAlexW3204544690MaRDI QIDQ5918684

Markus Lohrey

Publication date: 20 May 2022

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

Full work available at URL: https://arxiv.org/abs/2107.01630

zbMATH Keywords

hyperbolic groupsHNN-extensionsword problems

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The word problem in the Baumslag group with a non-elementary Dehn function is polynomial time decidable.
• Compressed word problems in HNN-extensions and amalgamated products
• The Nielsen reduction and P-complete problems in free groups
• On finitely generated soluble linear groups
• Almost finitely presented soluble groups
• An introduction to right-angled Artin groups.
• Verbal subgroups of hyperbolic groups have infinite width
• A logspace solution to the word and conjugacy problem of generalized Baumslag-Solitar groups
• Combinatorics of Coxeter Groups
• On the algorithmic insolvability of the word problem in group theory
• Subgroups of small Cancellation Groups
• Word Problems Solvable in Logspace
• WORD-HYPERBOLIC GROUPS HAVE REAL-TIME WORD PROBLEM
• The Compressed Word Problem for Groups
• DECIDABILITY AND COMPLEXITY IN AUTOMATIC MONOIDS
• THE LINEARITY OF THE CONJUGACY PROBLEM IN WORD-HYPERBOLIC GROUPS
• Knapsack problems in groups
• Computable Algebra, General Theory and Theory of Computable Fields
• ON PRODUCTS OF QUASICONVEX SUBGROUPS IN HYPERBOLIC GROUPS
• The word problem
• The word problem
• Logspace computations in graph products

This page was built for publication: Complexity of word problems for HNN-extensions