Results 21 to 30 of about 20,804 (234)
A Poset Classifying Non-Commutative Term Orders [PDF]
Discrete Mathematics & Theoretical Computer Science, 2001 We study a poset $\Re$ on the free monoid (X*) on a countable alphabet X.This poset is determined by the fact that its total extensions are precisely the standard term orders on X*.
Jan Snellman
doaj +1 more source
Free skew monoidal categories [PDF]
Journal of Pure and Applied Algebra, 2018 v3: published ...
Bourke, John, Lack, Stephen
openaire +3 more sources
On Second-Order Monadic Monoidal and Groupoidal Quantifiers [PDF]
Logical Methods in Computer Science, 2010 We study logics defined in terms of second-order monadic monoidal and groupoidal quantifiers. These are generalized quantifiers defined by monoid and groupoid word-problems, equivalently, by regular and context-free languages.
Juha Kontinen, Heribert Vollmer
doaj +1 more source
Free gs-Monoidal Categories and Free Markov Categories
Applied Categorical Structures, 2023 AbstractCategorical probability has recently seen significant advances through the formalism of Markov categories, within which several classical theorems have been proven in entirely abstract categorical terms. Closely related to Markov categories are gs-monoidal categories, also known as CD categories.
Fritz, Tobias, Liang, Wendong
openaire +3 more sources
Asymptotic properties of free monoid morphisms [PDF]
, 2016 Motivated by applications in the theory of numeration systems and recognizable sets of integers, this paper deals with morphic words when erasing morphisms are taken into account. Cobham showed that if an infinite word $w =g(f^\omega(a))$ is the image of
Charlier, Emilie +2 more
core +1 more source
International Journal of Mathematics and Mathematical Sciences, 1997 A comultiplication on a monoid S is a homomorphism m:S→S∗S (the free product of S with itself) whose composition with each projection is the identity homomorphism.
Martin Arkowitz, Mauricio Gutierrez
doaj +1 more source
Minimality over free monoid presentations
Hacettepe Journal of Mathematics and Statistics, 2014 Summary: As a continued study of the paper [\textit{A. S. Çevik}, Semigroup Forum 66, No. 1, 1-17 (2003; Zbl 1054.20039)], in here, we first state and prove the \(p\)-Cockcroft property (or, equivalently, efficiency) for a presentation, say \(\mathcal P_E\), of the semi-direct product of a free abelian monoid of rank two by a finite cyclic monoid. Then,
CEVİK, A. Sinan +3 more
openaire +6 more sources
Boolean Algebras with Semigroup Operators: Free Product and Free Objects
Journal of Mathematics, 2023 Two important algebraic structures are S-acts and Boolean algebras. Combining these two structures, one gets S-Boolean algebras, equipped with a compatible right action of a monoid S which is a special case of Boolean algebras with operators.
H. Barzegar
doaj +1 more source
Automaton semigroup constructions [PDF]
, 2013 The aim of this paper is to investigate whether the class of automaton semigroups is closed under certain semigroup constructions. We prove that the free product of two automaton semigroups that contain left identities is again an automaton semigroup. We
Brough, Tara, Cain, Alan J.
core +1 more source
Finitely presentable objects in ${\rm(}Cb\text{-}{\bf Sets}{\rm)}_{_{\rm fs}}$ [PDF]
Categories and General Algebraic Structures with ApplicationsPitts generalized nominal sets to finitely supported $Cb$-sets by utilizing the monoid $Cb$ of name substitutions instead of the monoid of finitary permutations over names.
Mahdieh Haddadi +2 more
doaj +1 more source