Results 1 to 10 of about 77 (63)

On the syntactic monoids associated with a class of synchronized codes. [PDF]

ScientificWorldJournal, 2013
A complete code C over an alphabet A is called synchronized if there exist x, y ∈ C* such that xA*∩A*y⊆C*. In this paper we describe the syntactic monoid Syn(C+) of C+ for a complete synchronized code C over A such that C+, the semigroup generated by C, is a single class of its syntactic congruence PC+.
Wang SF.
europepmc   +2 more sources

A characterization of seminormal C-monoids. [PDF]

Boll Unione Mat Ital (2008), 2019
Geroldinger A, Zhong Q.
europepmc   +1 more source

'Nobody could possibly misunderstand what a group is': a study in early twentieth-century group axiomatics. [PDF]

Arch Hist Exact Sci, 2017
Hollings CD.
europepmc   +1 more source

Time-Energy and Time-Entropy Uncertainty Relations in Nonequilibrium Quantum Thermodynamics under Steepest-Entropy-Ascent Nonlinear Master Equations. [PDF]

Entropy (Basel), 2019
Beretta GP.
europepmc   +1 more source

Semigroup-theoretic analysis of supply-chain disruptions and resilience. [PDF]

PLoS One
Opue JA, Sampson MI, Tom OJ, Okorie UE.
europepmc   +1 more source

Absolutely closed semigroups. [PDF]

Rev R Acad Cienc Exactas Fis Nat A Mat
Banakh T, Bardyla S.
europepmc   +1 more source

Rectangular groupoids and related structures.

Discrete Math, 2013
Boykett T.
europepmc   +1 more source

Elaborating the word problem for free idempotent-generated semigroups over the full transformation monoid

Semigroup Forum, 2022
With each semigroup one can associate a partial algebra, called the biordered set, which captures important algebraic and geometric features of the structure of idempotents of that semigroup. For a biordered set $\mathcal{E}$, one can construct the free idempotent-generated semigroup over $\mathcal{E}$, $\mathsf{IG}(\mathcal{E})$, which is the free-est
Igor Dolinka, Dolinka Igor
exaly   +3 more sources