AbstractSeveral constructions exist for the free inverse semigroup FIX with a set X of free generators. We offer a new construction that describes elements of FIX as shortest words in the classes of equivalent words over the alphabet X∪X−1 and produce an algorithm that transforms any word into its shortest equivalent form. Both known and new properties of FIX follow
A triple [S,T;U] where S and T are inverse semigroups and U is the intersection of S and T is called...
We show that the word problem is decidable for an amalgamated free product of finite inverse semigr...
We show that the word problem is decidable for an amalgamated free product of finite inverse semigr...
We study inverse semigroup amalgams of the form of free inverse semigroups S,T with core an arbitra...
We study inverse semigroup amalgams of the form of free inverse semigroups S,T with core an arbitra...
We study inverse semigroup amalgams of the form of free inverse semigroups S,T with core an arbitra...
We study inverse semigroup amalgams of the form of free inverse semigroups S,T with core an arbitra...
AbstractIn this paper we shall present a new construction of the free inverse monoid on a set X. Con...
AbstractA strict inverse semigroup can be constructed by means of the partially ordered set X = S/J ...
AbstractA strict inverse semigroup can be constructed by means of the partially ordered set X = S/J ...
International audienceWe study inverse semigroup amalgams [S 1 , S 2 ; U ], where S 1 and S 2 are fi...
A triple [S,T;U] where S and T are inverse semigroups and U is the intersection of S and T is called...
A triple [S,T;U] where S and T are inverse semigroups and U is the intersection of S and T is called...
A triple [S,T;U] where S and T are inverse semigroups and U is the intersection of S and T is called...
A triple [S,T;U] where S and T are inverse semigroups and U is the intersection of S and T is called...
A triple [S,T;U] where S and T are inverse semigroups and U is the intersection of S and T is called...
We show that the word problem is decidable for an amalgamated free product of finite inverse semigr...
We show that the word problem is decidable for an amalgamated free product of finite inverse semigr...
We study inverse semigroup amalgams of the form of free inverse semigroups S,T with core an arbitra...
We study inverse semigroup amalgams of the form of free inverse semigroups S,T with core an arbitra...
We study inverse semigroup amalgams of the form of free inverse semigroups S,T with core an arbitra...
We study inverse semigroup amalgams of the form of free inverse semigroups S,T with core an arbitra...
AbstractIn this paper we shall present a new construction of the free inverse monoid on a set X. Con...
AbstractA strict inverse semigroup can be constructed by means of the partially ordered set X = S/J ...
AbstractA strict inverse semigroup can be constructed by means of the partially ordered set X = S/J ...
International audienceWe study inverse semigroup amalgams [S 1 , S 2 ; U ], where S 1 and S 2 are fi...
A triple [S,T;U] where S and T are inverse semigroups and U is the intersection of S and T is called...
A triple [S,T;U] where S and T are inverse semigroups and U is the intersection of S and T is called...
A triple [S,T;U] where S and T are inverse semigroups and U is the intersection of S and T is called...
A triple [S,T;U] where S and T are inverse semigroups and U is the intersection of S and T is called...
A triple [S,T;U] where S and T are inverse semigroups and U is the intersection of S and T is called...
We show that the word problem is decidable for an amalgamated free product of finite inverse semigr...
We show that the word problem is decidable for an amalgamated free product of finite inverse semigr...
DOI
Add to ORKG