Results 41 to 50 of about 736 (119)
The cancellation law is a necessary condition for a semigroup to be embedded in a group. In general, this condition is not sufficient; necessary and sufficient conditions are rather complicated (see [1]). It is, therefore, of interest to find large classes of semigroups for which the cancellation law is sufficient to ensure embeddability in a group.
openaire +1 more source
For a positive integer \(n\), let \(\Sigma_n\) denote the alphabet consisting of letters \(x_0,x_1,\dots,x_{n-1}\). A triple \((\alpha,\beta,\gamma)\) of words over \(\Sigma_n\) is allowable if \(\alpha\) is a prefix of \(\beta\) and \(\gamma\) is a suffix of \(\beta\). Let \((\alpha,\beta,\gamma)\) and \((\alpha',\beta',\gamma')\) be allowable triples
openaire +1 more source
A semigroup \(S\) with zero 0 is called stratisfied if \(\bigcap_{m > 0} S^ m = \{0\}\). (The definition is effective for any semigroup, that is, a semigroup \(S\) is stratisfied if \(S^ 0\) is stratisfied.) The depth function \(\lambda : S \setminus \{0\} \to N\) assigns to each \(s \in S\), \(s\neq 0\), the greatest positive integer \(m\) such that \(
openaire +2 more sources
Cohen, Haskell, Collins, H. S.
openaire +2 more sources
Stepp, J.W., Fulp, R.O.
openaire +2 more sources
Ramifications of generalized Feller theory. [PDF]
Cuchiero C, Möllmann T, Teichmann J.
europepmc +1 more source
Stochastically evolving graphs via edit semigroups. [PDF]
Chung F, Robertson SJ.
europepmc +1 more source

