Complexity of word problems for HNN-extensions
From MaRDI portal
Publication:5925702
DOI10.1016/j.jcss.2023.02.005OpenAlexW3180837046MaRDI QIDQ5925702
Publication date: 21 April 2023
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2023.02.005
Cites Work
- 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
- Polynomial-time word problems.
- On finitely generated soluble linear groups
- Sur les groupes hyperboliques d'après Mikhael Gromov. (On the hyperbolic groups à la M. Gromov)
- Almost finitely presented soluble groups
- Das Identitätsproblem für Gruppen mit einer definierenden Relation
- An introduction to right-angled Artin groups.
- Algorithmics on SLP-compressed strings: A survey
- Artin groups of large type are shortlex automatic with regular geodesics
- Verbal subgroups of hyperbolic groups have infinite width
- Combinatorics of Coxeter Groups
- On the algorithmic insolvability of the word problem in group theory
- Context-Free Groups and Bass–Serre Theory
- Some two-generator one-relator non-Hopfian groups
- Subgroups of small Cancellation Groups
- Word Problems Solvable in Logspace
- POWER CIRCUITS, EXPONENTIAL ALGEBRA, AND TIME COMPLEXITY
- 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
- A non-cyclic one-relator group all of whose finite quotients are cyclic
- ON PRODUCTS OF QUASICONVEX SUBGROUPS IN HYPERBOLIC GROUPS
- The decision problem for some classes of sentences without quantifiers
- The word problem
- The word problem
- Logspace computations in graph products
- Parallel Algorithms for Power Circuits and the Word Problem of the Baumslag Group.
