Results 1 to 10 of about 4,202,174 (239)
Topologies for the free monoid
Journal of Algebra, 1991 The finite group (or profinite) topology was first introduced for the free group by M. Hall Jr. and by Reutenauer for free monoids. This is the initial topology defined by all the monoid morphisms from the free monoid into a discrete finite group. The p-adic topology is defined in the same way by replacing "group" by "p-group" in the definition.
J. Pin
semanticscholar +5 more sources
Congruences on the partial automorphism monoid of a free group action [PDF]
International journal of algebra and computation, 2020 We study congruences on the partial automorphism monoid of a finite rank free group action. We determine a decomposition of a congruence on this monoid into a Rees congruence, a congruence on a Brandt semigroup and an idempotent separating congruence ...
Matthew Brookes
semanticscholar +3 more sources
Further results on skew monoid rings of a certain free monoid (I)
, 2018 Let R be a ring with an endomorphism , F be a free monoid and S be a factor of such that for some positive integer . The second author and Moussavi [Annihilator properties of skew monoid rings, Comm.
K. Paykan, M. Habibi
semanticscholar +2 more sources
Crisp and Fuzzy Granular Hierarchical Structures Generated from a Free Monoid
Journal of Advanced Computational Intelligence and Intelligent Informatics, 2014 T. Murai +4 more
semanticscholar +2 more sources
On the rational subsets of the monogenic free inverse monoid [PDF]
Journal of Algebra, 2022 We prove that the equality problem is decidable for rational subsets of the monogenic free inverse monoid F . It is also decidable whether or not a rational subset of F is recognizable.
Pedro V. Silva
semanticscholar +1 more source
Prefix monoids of groups and right units of special inverse monoids
Forum of Mathematics, Sigma, 2023 A prefix monoid is a finitely generated submonoid of a finitely presented group generated by the prefixes of its defining relators. Important results of Guba (1997), and of Ivanov, Margolis and Meakin (2001), show how the word problem for certain one ...
Igor Dolinka, Robert D. Gray
doaj +1 more source
Generalized Results on Monoids as Memory [PDF]
Electronic Proceedings in Theoretical Computer Science, 2017 We show that some results from the theory of group automata and monoid automata still hold for more general classes of monoids and models. Extending previous work for finite automata over commutative groups, we demonstrate a context-free language that ...
Özlem Salehi +2 more
doaj +1 more source
On morphisms preserving infinite Lyndon words [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 In a previous paper, we characterized free monoid morphisms preserving finite Lyndon words. In particular, we proved that such a morphism preserves the order on finite words.
Gwenael Richomme
doaj +3 more sources
Algebraic and combinatorial structures on Baxter permutations [PDF]
Discrete Mathematics & Theoretical Computer Science, 2011 We give a new construction of a Hopf subalgebra of the Hopf algebra of Free quasi-symmetric functions whose bases are indexed by objects belonging to the Baxter combinatorial family (\emphi.e.
Samuele Giraudo
doaj +1 more source
A Categorical Approach to Syntactic Monoids [PDF]
Logical Methods in Computer Science, 2018 The syntactic monoid of a language is generalized to the level of a symmetric monoidal closed category $\mathcal D$. This allows for a uniform treatment of several notions of syntactic algebras known in the literature, including the syntactic monoids of ...
Jiří Adamek +2 more
doaj +1 more source