Work

The Finite Basis Problem for Free Tree Monoids

Year: 2025

Type: article

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$ .

Source: Bulletin of the Australian Mathematical Society

DOI: 10.1017/s0004972725100385

Authors: YAN FENG LUO, ZHEN FENG JIN, WEN TING ZHANG

Institution: Lanzhou University

Language: English

Topic: semigroups and automata theory

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: gold

Estimated APC paid: $3,550

Funder: National Natural Science Foundation of China