Finite complete rewriting systems and biautomatic structures for Stylic monoids
We construct finite complete rewriting systems and biautomatic structures for Stylic monoids of finite rank. We further show that every Stylic monoid of finite rank has finite derivation type and satisfies the homological conditions left and right [Formula: see text].
Authors
- Wen Ting Zhang (ORCID: https://orcid.org/0000-0002-6261-3924)
- Zhen Jin (ORCID: https://orcid.org/0000-0002-9763-707X)
- Yan Luo
Institutions
- Lanzhou University (CN)
Publication Details
- Journal
- Journal of Algebra and Its Applications
- Published
- 2025-06-20
- DOI
- https://doi.org/10.1142/s0219498826502828
- Primary Topic
- semigroups and automata theory
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- National Natural Science Foundation of China