Results 1 to 10 of about 12,457 (110)
Flows on Classes of Regular Semigroups and Cauchy Categories
We consider the structure of the flow monoid for some classes of regular semigroups (which are special case of flows on categories) and for Cauchy categories.
Suha Ahmed Wazzan
doaj +2 more sources
On the structure of the infinitesimal generators of scalar one-dimensional semigroups with discrete Lyapunov functionals [PDF]
Dynamical systems generated by scalar reaction-diffusion equations on an interval enjoy special properties that lead to a very simple structure for the semiflow.
Giorgio Fusco, Carlos Rocha
semanticscholar +1 more source
Inverse Semigroups of Metrics on Doubles Related to Certain Subsets [PDF]
Recently we have shown that the equivalence classes of metrics on the double of a metric space $$X$$ form an inverse semigroup. Here we define an inverse subsemigroup related to a family of isometric subspaces of $$X$$ , which is more computable.
V. Manuilov
semanticscholar +1 more source
Polyadic Braid Operators and Higher Braiding Gates
A new kind of quantum gates, higher braiding gates, as matrix solutions of the polyadic braid equations (different from the generalized Yang–Baxter equations) is introduced. Such gates lead to another special multiqubit entanglement that can speed up key
Steven Duplij, Raimund Vogl
doaj +1 more source
Endomorphisms and anti-endomorphisms of some finite groupoids
In this paper, we study anti-endomorphisms of some finite groupoids. Previously, special groupoids $S(k, q)$ of order $k(1+k)$ with a generating set of $k$ elements were introduced.
Litavrin Andrey V.
doaj +1 more source
Geometric approximations to transition densities of Jump-type Markov processes
This paper is concerned with the transition functions of symmetric Levy-type processes generated by a pseudo-differential operator with variable coefficients.
Zhuang Yuanying, Song Xiao
doaj +1 more source
Some special congruences on completely regular semigroups [PDF]
This paper enriches the list of properties of the congruence sequences starting from the universal relation and successively performing the operations of lower t and lower k.
Li-min Wang +2 more
semanticscholar +1 more source
Self-Automaton Semigroups [PDF]
After reviewing automaton semigroups, we introduce Cayley Automata and the corresponding Cayley Automaton semigroups. We investigate which semigroups are isomorphic to their Cayley Automaton semigroup and give some results for special classes of ...
McLeman, Alexander
core +1 more source
Automatic presentations for semigroups [PDF]
Special Issue: 2nd International Conference on Language and Automata Theory and Applications (LATA 2008)This paper applies the concept of FA-presentable structures to semigroups.
Cain, Alan James +3 more
core +1 more source
Complexity of Left-Ideal, Suffix-Closed and Suffix-Free Regular Languages [PDF]
A language $L$ over an alphabet $\Sigma$ is suffix-convex if, for any words $x,y,z\in\Sigma^*$, whenever $z$ and $xyz$ are in $L$, then so is $yz$. Suffix-convex languages include three special cases: left-ideal, suffix-closed, and suffix-free languages.
B Krawetz +19 more
core +2 more sources

