Results 31 to 40 of about 4,202,174 (239)

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

Comultiplication on monoids

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

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

Rewriting in Free Hypergraph Categories [PDF]

Electronic Proceedings in Theoretical Computer Science, 2017
We study rewriting for equational theories in the context of symmetric monoidal categories where there is a separable Frobenius monoid on each object. These categories, also called hypergraph categories, are increasingly relevant: Frobenius structures ...
Fabio Zanasi
doaj   +1 more source

Finitely presentable objects in ${\rm(}Cb\text{-}{\bf Sets}{\rm)}_{_{\rm fs}}$ [PDF]

Categories and General Algebraic Structures with Applications
Pitts 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, Khadijeh Keshvardoost, Aliyeh Hosseinabadi   +2 more
doaj   +1 more source

The \v Cerný conjecture for aperiodic automata [PDF]

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.
A. N. Trahtman
doaj   +1 more source

On a complete topological inverse polycyclic monoid

Karpatsʹkì Matematičnì Publìkacìï, 2016
We give sufficient conditions when a topological inverse $\lambda$-polycyclic monoid $P_{\lambda}$ is absolutely $H$-closed in the class of topological inverse semigroups.
S.O. Bardyla, O.V. Gutik
doaj   +1 more source

Measuring cones and other thick subsets in free groups [PDF]

International Journal of Group Theory, 2018
In this paper we investigate the special automata over finite rank free groups and estimate asymptotic characteristics of sets they accept‎. ‎We show how one can decompose an arbitrary regular subset of a finite rank free group into disjoint union of ...
Elizaveta Frenkel, Vladimir Remeslennikov   +1 more
doaj   +1 more source

Commutativity in free inverse monoids

Theoretical Computer Science, 1998
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
D'ALESSANDRO, Flavio, Christian Choffrut
openaire   +2 more sources

On the Algebra of a Free Inverse Monoid

Journal of Algebra, 1996
Let \(S\) be an ideal of a free inverse monoid \(M\). It is shown that for the semigroup algebra \(F[S]\) over a field \(F\) the following three conditions are equivalent: (i) \(F[S]\) is prime; (ii) \(F[S]\) is primitive, (iii) \(M\) has infinite rank. This is an extension of a theorem of \textit{P. V. Silva} [Proc. R. Soc. Edinb., Sect. A 120, No.
W. D. Munn, M.J. Crabb
openaire   +2 more sources