Results 101 to 110 of about 20,804 (234)
Ideal Extensions of Free Commutative Monoids
Bulletin of the Malaysian Mathematical Sciences SocietyWe introduce a new family of monoids, which we call gap absorbing monoids. Every gap absorbing monoid is an ideal extension of a free commutative monoid. For a gap absorbing monoid $S$ we study its set of atoms and Betti elements, which allows us to show that the catenary degree of $S$ is at most four and that the set of lengths of any element in $S ...
Cisto, Carmelo +2 more
openaire +3 more sources
On the rational subsets of the monogenic free inverse monoid [PDF]
, 2022 Pedro V. Silva
openalex +1 more source
The trace monoids in the queue monoid and in the direct product of two free monoids [PDF]
, 2016 Dietrich Kuske, Olena Prianychnykova
openalex +2 more sources
The geometry of profinite graphs with applications to free groups and finite monoids [PDF]
, 2003 Karl Auinger, Benjamin Steinberg
openalex +1 more source
Topological Methods for Studying Contextuality: N-Cycle Scenarios and Beyond. [PDF]
Entropy (Basel), 2023 Kharoof A, Ipek S, Okay C.
europepmc +1 more source
An operad structure on the free commutative monoid over a positive operad [PDF]
, 2023 Dominique Manchon +3 more
openalex
Purity of monoids and characteristic-free splittings in semigroup rings [PDF]
, 2022 Alessandro De Stefani +2 more
openalex +1 more source
On free inverse monoid languages [PDF]
RAIRO - Theoretical Informatics and Applications, 1996 Summary: This is a study on the class of \(\text{FIM}(X)\)-languages and its important subfamily consisting of inverse automata languages (\(i\)-languages). Both algebraic and combinatorial approaches are used to obtain several results concerning closure operators on \((X\cup X^{-1})^*\)-languages, including a classification of \(\text{FIM}(X ...
openaire +2 more sources
The Černý Conjecture for Aperiodic Automata
Discrete Mathematics & Theoretical Computer Science, 2007 A word w is called a synchronizing (recurrent, reset, directable) word of a deterministic finite automaton (DFA) if w brings all states of the automaton to some specific state; a DFA that has a synchronizing word is said to be synchronizable.
Avraham N. Trahtman
doaj
On the Word Problem for Free Products of Semigroups and Monoids [PDF]
, 2021 Carl‐Fredrik Nyberg‐Brodda
openalex +1 more source