Results 11 to 20 of about 30,322 (203)
Generalized Results on Monoids as Memory [PDF]
Electronic Proceedings in Theoretical Computer Science, 2017 We show that some results from the theory of group automata and monoid automata still hold for more general classes of monoids and models. Extending previous work for finite automata over commutative groups, we demonstrate a context-free language that ...
Özlem Salehi +2 more
doaj +3 more sources
The monoid-now: a category theoretic approach to the structure of phenomenological time-consciousness [PDF]
Frontiers in Psychology, 2023 Human consciousness is characterized by constant transitions in time. On the other hand, what is consciously experienced always possesses the temporal feature of “now.” In consciousness, “now” constantly holds different contents, yet it remains “now” no ...
Shigeru Taguchi +2 more
doaj +2 more sources
S-acts over a Well-ordered Monoid with Modular Congruence Lattice
Известия Иркутского государственного университета: Серия "Математика", 2021 This work relates to the structural act theory. The structural theory includes the description of acts over certain classes of monoids or having certain properties, for example, satisfying some requirement for the congruence lattice.
A.A. Stepanova
doaj +1 more source
A PRESENTATION FOR A SUBMONOID OF THE SYMMETRIC INVERSE MONOID
Ural Mathematical Journal, 2023 In the present paper, we study a submonoid of the symmetric inverse semigroup \(I_n\). Specifically, we consider the monoid of all order-, fence-, and parity-preserving transformations of \(I_n\).
Apatsara Sareeto, Jörg Koppitz
doaj +1 more source
Primitive orthogonal idempotents for R-trivial monoids [PDF]
Discrete Mathematics & Theoretical Computer Science, 2011 We construct a recursive formula for a complete system of primitive orthogonal idempotents for any R-trivial monoid. This uses the newly proved equivalence between the notions of R-trivial monoid and weakly ordered monoid.
Chris Berg +3 more
doaj +1 more source
Semigroup Forum, 2021 We construct certain monoids, called tied monoids. These monoids result to be semidirect products finitely presented and commonly built from braid groups and their relatives acting on monoids of set partitions. The nature of our monoids indicate that they should give origin to new knot algebras; indeed, our tied monoids include the tied braid monoid ...
Arcis, Diego, Juyumaya, Jesús
openaire +3 more sources
Monoidal Supercategories [PDF]
Communications in Mathematical Physics, 2017 42 pages, sign error in Definition 1.16 ...
Brundan, Jonathan, Ellis, Alexander P.
openaire +2 more sources
Logical Methods in Computer Science, 2023 We introduce monoidal width as a measure of complexity for morphisms in monoidal categories. Inspired by well-known structural width measures for graphs, like tree width and rank width, monoidal width is based on a notion of syntactic decomposition: a monoidal decomposition of a morphism is an expression in the language of monoidal categories, where ...
Elena Di Lavore, Paweł Sobociński
openaire +4 more sources
All Maximal Idempotent Submonoids of Generalized Cohypersubstitutions of Type τ = (2)
Discussiones Mathematicae - General Algebra and Applications, 2021 A generalized cohypersubstitution of type τ is a mapping σ which maps every ni-ary cooperation symbol fi to the coterm σ(f ) of type τ = (ni)i∈I. Denote by CohypG(τ) the set of all generalized cohypersubstitutions of type τ.
Chansuriya Nagornchat
doaj +1 more source
Prefix monoids of groups and right units of special inverse monoids
Forum of Mathematics, Sigma, 2023 A prefix monoid is a finitely generated submonoid of a finitely presented group generated by the prefixes of its defining relators. Important results of Guba (1997), and of Ivanov, Margolis and Meakin (2001), show how the word problem for certain one ...
Igor Dolinka, Robert D. Gray
doaj +1 more source