The Conjugacy Problem for HNN Extensions with Infinite Cyclic Associated Groups
From MaRDI portal
Publication:4290833
DOI10.2307/2160210zbMath0804.20029MaRDI QIDQ4290833
Publication date: 17 January 1995
Full work available at URL: https://doi.org/10.2307/2160210
HNN extensions; inverse semigroups; conjugacy problem; bicyclic semigroup; solvable extended word problem
20M05: Free semigroups, generators and relations, word problems
20E06: Free products of groups, free products with amalgamation, Higman-Neumann-Neumann extensions, and generalizations
20F10: Word problems, other decision problems, connections with logic and automata (group-theoretic aspects)
20M18: Inverse semigroups
Cites Work
- Unnamed Item
- Unnamed Item
- Reducibilities Among Decision Problems for HNN Groups, Vector Addition Systems and Subsystems of Peano Arithmetic
- An Hnn-Extension with Cyclic Associated Subgroups and with Unsolvable Conjugacy Problem
- The Conjugacy Problem for Graph Products with Finite Cyclic Edge Groups
- Conjugate Powers in HNN Groups
- The lattice of inverse subsemigroups of a reduced inverse semigroup
- The Conjugacy Problem for HNN Groups and the Word Problem For Commutative Semigroups
- The Conjugacy Problem for Graph Products with Central Cyclic Edge Groups