THE FINITE BASIS PROBLEM FOR FREE TREE MONOIDS
Abstract For each $n\geq 1$ , let $FT_n$ be the free tree monoid of rank n and $E_n$ the full extensive transformation monoid over the finite chain $\{1, 2, \ldots , n\}$ . It is shown that the monoids $FT_n$ and $E_{n+1}$ satisfy the same identities. Therefore, $FT_n$ is finitely based if and only if $n\leq 3$ .
Authors
- Wen Ting Zhang (ORCID: https://orcid.org/0000-0002-6261-3924)
- Yanfeng Luo (ORCID: https://orcid.org/0000-0003-0513-334X)
- Zhenzhen Zhu Jing Jin
Institutions
- Lanzhou University of Technology (CN)
- Lanzhou University (CN)
Publication Details
- Journal
- Bulletin of the Australian Mathematical Society
- Published
- 2025-08-08
- DOI
- https://doi.org/10.1017/s0004972725100385
- Primary Topic
- semigroups and automata theory
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- National Natural Science Foundation of China