AbstractIn this paper we shall present a new construction of the free inverse monoid on a set X. Contrary to the previous constructions of [9, 11], our construction is symmetric and originates from classical ideas of language theory. The ingredients of this construction are the free group on X and the relation that associates to a word w of the free monoid on X, the set of all pairs (u, v) such that uv = w. It follows at once from our construction that the free inverse monoid on X can be naturally embedded into the Schützenberger product of two free groups of basis X. We shall also give some connections with the theory of expansions as developed by Rhodes and Birget [2, 3]
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...
AbstractIn this paper we shall present a new construction of the free inverse monoid on a set X. Con...
The study of words as a mathematical object is a deep and rich field of study. Algebra, Combinatoric...
AbstractThis paper is the first of two papers devoted to the study of amalgamated free products of i...
AbstractIn [Studia Sci. Math. Hungar. 41 (2004) 39–58] we constructed for a completely simple semigr...
AbstractThis paper provides a model for the free rectangular band of inverse semigroups on a set and...
AbstractRepresentations for the free rectangular band of inverse semigroups on a set and the free pe...
In this paper, generalizing the study of free partially commutative inverse monoids [5], for any rew...
AbstractSeveral constructions exist for the free inverse semigroup FIX with a set X of free generato...
AbstractGeometric methods have played a fundamental and crucial role in combinatorial group theory a...
We focus on three constructions: amalgamated free products of inverse semigroups, C*-algebras of inv...
A triple [S,T;U] where S and T are inverse semigroups and U is the intersection of S and T is called...
Finite automata and rational languages are fundamental concepts in theoretical computer science and ...
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...
AbstractIn this paper we shall present a new construction of the free inverse monoid on a set X. Con...
The study of words as a mathematical object is a deep and rich field of study. Algebra, Combinatoric...
AbstractThis paper is the first of two papers devoted to the study of amalgamated free products of i...
AbstractIn [Studia Sci. Math. Hungar. 41 (2004) 39–58] we constructed for a completely simple semigr...
AbstractThis paper provides a model for the free rectangular band of inverse semigroups on a set and...
AbstractRepresentations for the free rectangular band of inverse semigroups on a set and the free pe...
In this paper, generalizing the study of free partially commutative inverse monoids [5], for any rew...
AbstractSeveral constructions exist for the free inverse semigroup FIX with a set X of free generato...
AbstractGeometric methods have played a fundamental and crucial role in combinatorial group theory a...
We focus on three constructions: amalgamated free products of inverse semigroups, C*-algebras of inv...
A triple [S,T;U] where S and T are inverse semigroups and U is the intersection of S and T is called...
Finite automata and rational languages are fundamental concepts in theoretical computer science and ...
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...