Results 31 to 40 of about 20,804 (234)
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
Gcd-monoids arising from homotopy groupoids [PDF]
, 2018 The interval monoid $\Upsilon$(P) of a poset P is defined by generators [x, y], where x $\le$ y in P , and relations [x, x] = 1, [x, z] = [x, y] $\times$ [y, z] for x $\le$ y $\le$ z.
Wehrung, Friedrich
core +2 more sources
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
Syntactic Monoids in a Category [PDF]
, 2015 The syntactic monoid of a language is generalized to the level of a symmetric monoidal closed category D. This allows for a uniform treatment of several notions of syntactic algebras known in the literature, including the syntactic monoids of Rabin and ...
Adamek, Jiri +2 more
core +2 more sources
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
Resolutions for free partially commutative monoids [PDF]
Siberian Mathematical Journal, 2007 A free resolution of free partially commutative monoids is constructed and with its help the homological dimension of these monoids is calculated.
openaire +3 more sources
The Largest Subsemilattices of the Endomorphism Monoid of an Independence Algebra [PDF]
, 2014 An algebra $\A$ is said to be an independence algebra if it is a matroid algebra and every map $\al:X\to A$, defined on a basis $X$ of $\A$, can be extended to an endomorphism of $\A$.
Araújo, João +2 more
core +2 more sources
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 +1 more
doaj +1 more source
Free operated monoids and rewriting systems [PDF]
Semigroup Forum, 2018 17 ...
Zhang, Jin, Gao, Xing
openaire +2 more sources
Explicit left orders on free groups extending the lexicographic order on free monoids [PDF]
, 2013 For every finitely generated free group we construct an explicit left order extending the lexicographic order on the free monoid generated by the positive letters. The order is defined by a left, free action on the orbit of 0 of a free group of piecewise
Sunic, Zoran
core +3 more sources