The Intersection of 3-Maximal Submonids

DOI10.1016/J.TCS.2021.11.024arXiv2008.01824MaRDI QIDQ6346502FDOQ6346502

Authors: G. Castiglione, Štěpán Holub 

Publication date: 4 August 2020

Abstract: Very little is known about the structure of the intersection of two $k$-generated monoids of words, even for $k=3$. Here we investigate the case of $k$-maximal monoids, that is, monoids whose basis of cardinality $k$ cannot be non-trivially decomposed into at most $k$ words. We characterize the intersection in the case of two $3$-maximal monoids.

Mathematics Subject Classification ID

Combinatorics on words (68R15) Free semigroups, generators and relations, word problems (20M05)

This page was built for publication: The Intersection of $3$-Maximal Submonids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6346502)