2022/06/18 by Mikhail V. Volkov, Volkov, Mikhail V. · 1 citation
Arts and Humanities · Computer Science · #20M05 20M07 #FOS: Mathematics #Group Theory (math.GR) #Natural Language Processing Techniques #Translation Studies and Practices #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.2206.09129
openalex publication_date 2022/06/18 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We observe that for each n≥ 2, the identities of the stylic monoid with n generators coincide with the identities of n-generated monoids from other distinguished series of \mathscrJ-trivial monoids studied in the literature, e.g., Catalan monoids and Kiselman monoids. This solves the Finite Basis Problem for stylic monoids.