The intersection of 3-maximal submonoids

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F22%3A10453770" target="_blank" >RIV/00216208:11320/22:10453770 - isvavai.cz</a>
Result on the web
<a href="https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=e5jo6~htoJ" target="_blank" >https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=e5jo6~htoJ</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.tcs.2021.11.024" target="_blank" >10.1016/j.tcs.2021.11.024</a>

Result language
angličtina
Original language name
The intersection of 3-maximal submonoids
Original language description
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. (C) 2021 Elsevier B.V. All rights reserved.
Czech name
—
Czech description
—

Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year
2022
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)