We prove that the word problem is decidable in Yamamura’s HNN extensions of finite inverse semigroups, by providing an iterative construction of approximate automata of the Schützenberger automata of words relative to the standard presentation of Yamamura’s HNN-extensions
In this paper, we study the word problem for automaton semigroups and automaton groups from a comple...
In this paper, we study the word problem for automaton semigroups and automaton groups from a comple...
In this paper, we study the word problem for automaton semigroups and automaton groups from a comple...
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...
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...
The solvability of the word problem for Yamamura’s HNN-extensions [ S; A1, A2; φ] has been proved in...
This paper is a survey of some recent results on theword problemfor amalgams of inverse semigroups....
This paper is a survey of some recent results on theword problemfor amalgams of inverse semigroups....
This paper is a survey of some recent results on theword problemfor amalgams of inverse semigroups....
In this paper, we study the word problem for automaton semigroups and automaton groups from a comple...
In this paper, we study the word problem for automaton semigroups and automaton groups from a comple...
In this paper, we study the word problem for automaton semigroups and automaton groups from a comple...
In this paper, we study the word problem for automaton semigroups and automaton groups from a comple...
In this paper, we study the word problem for automaton semigroups and automaton groups from a comple...
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...
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...
The solvability of the word problem for Yamamura’s HNN-extensions [ S; A1, A2; φ] has been proved in...
This paper is a survey of some recent results on theword problemfor amalgams of inverse semigroups....
This paper is a survey of some recent results on theword problemfor amalgams of inverse semigroups....
This paper is a survey of some recent results on theword problemfor amalgams of inverse semigroups....
In this paper, we study the word problem for automaton semigroups and automaton groups from a comple...
In this paper, we study the word problem for automaton semigroups and automaton groups from a comple...
In this paper, we study the word problem for automaton semigroups and automaton groups from a comple...
In this paper, we study the word problem for automaton semigroups and automaton groups from a comple...
In this paper, we study the word problem for automaton semigroups and automaton groups from a comple...
DOI
Add to ORKG