Add to ORKGAbstract. It is shown that the compressed word problem for an HNN-extension 〈H, t | t−1at = ϕ(a)(a ∈ A) 〉 with A finite is polynomial time Turing-reducible to the compressed word problem for the base group H. An analogous result for amalgamated free products is shown as well.
We prove that the word problem is decidable in Yamamura’s HNN extensions of finite inverse semigroup...
We prove that the word problem is decidable in Yamamura’s HNN extensions of finite inverse semigroup...
We prove that the word problem is decidable in Yamamura’s HNN extensions of finite inverse semigroup...
Abstract. A compressed variant of the word problem for finitely generated groups, where the input wo...
The Compressed Word Problem for Groups provides a detailed exposition of known results on the compre...
We prove that the compressed word problem and the compressed simultaneous conjugacy problem are solv...
We prove that the compressed word problem and the compressed simultaneous conjugacy problem are solv...
The solvability of the word problem for Yamamura’s HNN-extensions [ S; A1, A2; φ] has been proved in...
In this work we introduce a new succinct variant of the word problem in a finitely generated group G...
The solvability of the word problem for Yamamura’s HNN-extensions [ S; A1, A2; φ] has been proved in...
The solvability of the word problem for Yamamura’s HNN-extensions [ S; A1, A2; φ] has been proved in...
The solvability of the word problem for Yamamura’s HNN-extensions [ S; A1, A2; φ] has been proved in...
We prove two theorems regarding the algorithmic theory of groups. First, that the compressed word pr...
AbstractWe investigate the behavior of equivariant and non-equivariant Hilbert space compression und...
We find polynomial-time solutions to the word problem for free-by-cyclic groups, the word problem fo...
We prove that the word problem is decidable in Yamamura’s HNN extensions of finite inverse semigroup...
We prove that the word problem is decidable in Yamamura’s HNN extensions of finite inverse semigroup...
We prove that the word problem is decidable in Yamamura’s HNN extensions of finite inverse semigroup...
Abstract. A compressed variant of the word problem for finitely generated groups, where the input wo...
The Compressed Word Problem for Groups provides a detailed exposition of known results on the compre...
We prove that the compressed word problem and the compressed simultaneous conjugacy problem are solv...
We prove that the compressed word problem and the compressed simultaneous conjugacy problem are solv...
The solvability of the word problem for Yamamura’s HNN-extensions [ S; A1, A2; φ] has been proved in...
In this work we introduce a new succinct variant of the word problem in a finitely generated group G...
The solvability of the word problem for Yamamura’s HNN-extensions [ S; A1, A2; φ] has been proved in...
The solvability of the word problem for Yamamura’s HNN-extensions [ S; A1, A2; φ] has been proved in...
The solvability of the word problem for Yamamura’s HNN-extensions [ S; A1, A2; φ] has been proved in...
We prove two theorems regarding the algorithmic theory of groups. First, that the compressed word pr...
AbstractWe investigate the behavior of equivariant and non-equivariant Hilbert space compression und...
We find polynomial-time solutions to the word problem for free-by-cyclic groups, the word problem fo...
We prove that the word problem is decidable in Yamamura’s HNN extensions of finite inverse semigroup...
We prove that the word problem is decidable in Yamamura’s HNN extensions of finite inverse semigroup...
We prove that the word problem is decidable in Yamamura’s HNN extensions of finite inverse semigroup...