Results 21 to 30 of about 4,202,174 (239)
Transducers and the decidability of independence in free monoids
Theoretical Computer Science, 1994 AbstractA transducer-based general method is derived by which proofs of the decidability of independence of regular languages with respect to a given relation can be obtained. This permits a uniform proof of the decidability of certain code properties which so far has only been obtained using separate, quite different and ad hoc proofs.
Helmut Jürgensen +2 more
openalex +4 more sources
Systems of equations over a free monoid and Ehrenfeucht's conjecture
Discrete Mathematics, 1983 K. Culík, J. Karhumäki
semanticscholar +2 more sources
Perfect congruences on a free monoid [PDF]
Proceedings of the American Mathematical Society, 1987 A congruence \(\rho\) on a monoid M is said to be ''perfect'' if the product of any two \(\rho\)-classes, considered as subsets of M, is a full \(\rho\)- class. The authors investigate the family \({\mathcal P}{\mathcal C}(X^*)\) of perfect congruences on the free monoid \(X^*\) on the alphabet X. They show that \(\rho\) is perfect if and only if it is
Mario Petrich, C. M. Reis
openalex +4 more sources
Hilbert series of mixed braid monoid $ MB_{2, 2} $
AIMS Mathematics, 2022 Hilbert series is a simplest way to calculate the dimension and the degree of an algebraic variety by an explicit polynomial equation. The mixed braid group $ B_{m, n} $ is a subgroup of the Artin braid group $ B_{m+n} $.
Zaffar Iqbal +3 more
doaj +1 more source
Minimality over free monoid presentations [PDF]
Hacettepe Journal of Mathematics and Statistics, 2014 As a continues study of the paper [4], in here, we first state and prove thep-Cockcroft property (or, equivalently, eciency) for a presentation, say PE, of the semi-direct product of a free abelian monoid rank two by a finite cyclic monoid. Then, in a separate section, we present sucient conditions on a special case for PE to be minimal whilst it is ...
A. Cevik +3 more
semanticscholar +5 more sources
Journal of Algebra and its Applications, 2020 Let [Formula: see text] be an atomic monoid. For [Formula: see text], let [Formula: see text] denote the set of all possible lengths of factorizations of [Formula: see text] into irreducibles.
F. Gotti
semanticscholar +1 more source
Additive monotones for resource theories of parallel-combinable processes with discarding [PDF]
Electronic Proceedings in Theoretical Computer Science, 2015 A partitioned process theory, as defined by Coecke, Fritz, and Spekkens, is a symmetric monoidal category together with an all-object-including symmetric monoidal subcategory.
Brendan Fong, Hugo Nava-Kopp
doaj +1 more source
On Undecidability of Finite Subsets Theory for Torsion Abelian Groups
Mathematics, 2022 Let M be a commutative cancellative monoid with an element of infinite order. The binary operation can be extended to all finite subsets of M by the pointwise definition. So, we can consider the theory of finite subsets of M.
Sergey Mikhailovich Dudakov
doaj +1 more source
Congruences on free monoids and submonoids of polycyclic monoids [PDF]
Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics, 1993 AbstractWe establish a one-to-one “group-like” correspondence between congruences on a free monoid X* and so-called positively self-conjugate inverse submonoids of the polycyclic monoid P(X). This enables us to translate many concepts in semigroup theory into the language of inverse semigroups.
John Meakin, Mark Sapir
openaire +3 more sources
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