Results 191 to 200 of about 4,202,174 (239)
Free Monoid in Monoidal Abelian Categories [PDF]
Applied Categorical Structures, 2004 We give an explicit construction of the free monoid in monoidal abelian categories when the monoidal product does not necessarily preserve coproducts.
B. Vallette
semanticscholar +4 more sources
The Frobenius Problem in a Free Monoid [PDF]
Symposium on Theoretical Aspects of Computer Science, 2007 The classical Frobenius problem over ${mathbb N}$ is to compute the largest integer $g$ not representable as a non-negative integer linear combination of non-negative integers $x_1, x_2, ldots, x_k$, where $gcd(x_1, x_2, ldots, x_k) = 1$.
Jui-Yi Kao, J. Shallit, Zhi Xu
semanticscholar +6 more sources
The Trace Monoids in the Queue Monoid and in the Direct Product of Two Free Monoids [PDF]
International Conference on Developments in Language Theory, 2016 We prove that a trace monoid embeds into the queue monoid if and only if it embeds into the direct product of two free monoids. We also give a decidable characterization of these trace monoids.
D. Kuske, Olena Prianychnykova
semanticscholar +4 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Weighted infinitesimal unitary bialgebras on free monoid algebras
Colloquium Mathematicum, 2021. The concept of a weighted infinitesimal unitary bialgebra is an algebraic abstraction of the non-homogeneous associative classical Yang–Baxter equation. In this paper, we equip the free monoid algebra with a suitable coproduct which makes it a weighted
Dan Chen +3 more
semanticscholar +1 more source
The intersection of free submonoids of a free monoid is free
Semigroup Forum, 1972 Several necessary and sufficient conditions exist for a submonoid of a free monoid to be free. For a few, see [1] through [6]. This short note uses one of these conditions, due to Schutzenberger (see [2], p. 119, or [4], Theorem 1.4) to establish that the intersection of free submonoids of a free monoid M is again free.
B. Tilson
semanticscholar +4 more sources
On deciding whether a monoid is a free monoid or is a group
Acta Informatica, 1986Monoids which are described by a given finite presentation (\(\Sigma\) ;R), i.e. \(\Sigma\) is a finite alphabet and R is a finite string-rewriting system on \(\Sigma\), are considered. It is shown that the problem whether or not such a monoid is a free one or a group are undecidable in general.
F. Otto
semanticscholar +3 more sources
On the algebra of a free monoid
Proceedings of the Royal Society of Edinburgh: Section A Mathematics, 1996Let denote a subring of the complex field that contains 1 and is closed under complex conjugation. It is shown that, with respect to the involution induced by word-reversal, the algebra over of a free monoid admits a trace and a separating family of star matrix representations.
M. Crabb +3 more
semanticscholar +4 more sources
The Post Correspondence Problem and equalisers for certain free group and monoid morphisms
International Colloquium on Automata, Languages and Programming, 2020A marked free monoid morphism is a morphism for which the image of each generator starts with a different letter, and immersions are the analogous maps in free groups.
L. Ciobanu, Alan D. Logan
semanticscholar +1 more source
On Languages Factorizing the Free Monoid
International Journal of Algebra and Computation, 1996A language X⊂A* is called factorizing if there exists a language Y⊂A* such that XY = A* This work was partially supported by ESPRIT-EBRA project ASMICS contact 6317 and project 40% MURST “Algoritmi, Modelli di Calcolo e Strutture Informative”. and the product is unambiguous.
M. Anselmo, A. Restivo
semanticscholar +5 more sources
A sufficient condition for the Hanna Neumann property of submonoids of a free monoid
arXiv.org, 2011Using an automata-theoretic approach, Giambruno and Restivo have investigated the intersection of two finitely generated submonoids of the free monoid over a finite alphabet.
S. Singh, K. V. Krishna
semanticscholar +1 more source