Results 51 to 60 of about 183 (95)
COMPLETIONS OF MONOIDS WITH APPLICATIONS TO THE CUNTZ SEMIGROUP
We provide an abstract categorical framework that relates the Cuntz semigroups of the C*-algebras A and [Formula: see text]. This is done through a certain completion of ordered monoids by adding suprema of countable ascending sequences.
RAMON ANTOINE +2 more
core +1 more source
A classification of rational languages by semilattice-ordered monoids [PDF]
summary:We prove here an Eilenberg type theorem: the so-called conjunctive varieties of rational languages correspond to the pseudovarieties of finite semilattice-ordered monoids. Taking complements of members of a conjunctive variety of languages we get
Polák, Libor
core +1 more source
International audienceWe introduce a notion of separativity for positively ordered monoids (POMs), similar in definition to the notion of separativity for commutative semigroups but which has a simple categorical equivalent, weaker that injectivity, the ...
Wehrung, Friedrich
core +1 more source
On the partially ordered monoid generated by the operators H, S, P, P
Let H, S, P be the standard operators on classes of algebras of the same type and Ps be the operator of closure under subdirect products. In this paper the monoid generated by class operators H, S, P, Ps and the corresponding partially ordered set are ...
Tasić, Boža
core +1 more source
On Pseudovarieties of Forest Algebras
Forest algebras are defined for investigating languages of forests [ordered sequences] of unranked trees, where a node may have more than two [ordered] successors.
Saeid Alirezazadeh
core +1 more source
The Wreath Product Principle for Ordered Semigroups
Straubing's wreath product principle provides a description of the languages recognized by the wreath product of two monoids. A similar principle for ordered semigroups is given in this paper.
Pascal Weil, L Laa, Jean-Eric Pin
core
Out-Of-Order Membership in Regular Languages [PDF]
We introduce the task of out-of-order membership to a formal language L, where the letters of a word w are revealed one by one in an arbitrary order.
Amarilli, Antoine +2 more
core +1 more source
Classes of filters in generalizations of commutative fuzzy structures [PDF]
summary:Bounded commutative residuated lattice ordered monoids ($R\ell $-monoids) are a common generalization of $\mathit {BL}$-algebras and Heyting algebras, i.e. algebras of basic fuzzy logic and intuitionistic logic, respectively.
Šalounová, Dana, Rachůnek, Jiří
core +1 more source
A groupoid approach to regular *-semigroups
In this paper we develop a new groupoid-based structure theory for the class of regular ⁎-semigroups. This class occupies something of a ‘sweet spot’ between the important classes of inverse and regular semigroups, and contains many natural examples ...
Muhammed, P. A. Azeef +1 more
core +1 more source
Extremal problems in combinatorial semigroup theory [PDF]
In this thesis we shall consider three types of extremal problems (i.e. problems involving maxima and minima) concerning semigroups. In the first chapter we show how to construct a minimal semigroup presentation that defines a group of non-negative ...
Mitchell, James David
core +1 more source

