Results 31 to 40 of about 12,395 (180)
Topological Structures Induced by General Fuzzy Automata Based on Lattice-ordered Monoid
The fundamental role of algebraic properties in the development of the basics of computer science has led researchers to study the concepts of fuzzy automaton separatedness, connectedness, and reversibility on a large scale.In this paper, the general ...
khadijeh abolpour
doaj
Rationality, irrationality, and Wilf equivalence in generalized factor order [PDF]
Let $P$ be a partially ordered set and consider the free monoid $P^{\ast}$ of all words over $P$. If $w,w' \in P^{\ast}$ then $w'$ is a factor of $w$ if there are words $u,v$ with $w=uw'v$. Define generalized factor order on $P^{\ast}$ by letting $u \leq
Sergey Kitaev +3 more
doaj +1 more source
On ideals of lattice ordered monoids [PDF]
Summary: In the paper the notion of an ideal of a lattice-ordered monoid \(A\) is introduced and relations between ideals of \(A\) and congruence relations on \(A\) are investigated. Further, it is shown that the set of all ideals of a soft lattice-ordered monoid or a negatively ordered monoid partially ordered by inclusion is an algebraic Brouwerian ...
openaire +2 more sources
Monoids with tests and the algebra of possibly non-halting programs [PDF]
We study the algebraic theory of computable functions, which can be viewed as arising from possibly non-halting computer programs or algorithms, acting on some state space, equipped with operations of composition, if-then-else and while-do defined in ...
Jackson, Marcel, Stokes, Tim E.
core +4 more sources
Galois orders in skew monoid rings
The paper deals with ring extensions \(\Gamma\subset U\) of an integral domain \(\Gamma\), in particular, a general class of subrings of invariants in twisted Galois semigroup rings which the authors call Galois orders. The study of such Galois orders is inspired by the authors' previous work on Harish-Chandra categories [Fibers of characters in Harish-
Futorny, Vyacheslav, Ovsienko, Serge
openaire +2 more sources
Ordered groupoids and the holomorph of an inverse semigroup
We present a construction for the holomorph of an inverse semigroup, derived from the cartesian closed structure of the category of ordered groupoids.
CJ Isham +14 more
core +1 more source
Varieties of Cost Functions. [PDF]
Regular cost functions were introduced as a quantitative generalisation of regular languages, retaining many of their equivalent characterisations and decidability properties.
Daviaud, L., Kuperberg, D., Pin, J-E.
core +5 more sources
Abstract An ordered monoid S in which every principal left ideal, regarded as an S-poset, is projective is called an ordered left PP monoid, for short, an ordered lpp monoid. In this paper, we introduce a new kind of ordered relations instead of Green relations adopted by J. B. Fountain, ordered lpp monoids are described by these ordered
openaire +1 more source
Right-orderability versus left-orderability for monoids
We investigate the relationship between (total) left- and right-orderability for monoids, in particular illustrating the finite case by various structural observations and counterexamples, also highlighting the particular role played by \emph{positive} orderability.Moreover, we construct a non-left-orderable, positively right-orderable submonoid of the
openaire +5 more sources
On a complete lattice of retracts of a free monoid generated by three elements [PDF]
We prove that the family of retracts of a free monoid generated by three elements, partially ordered with respect to the inclusion, is a complete lattice.
Wit Foryś
doaj

