2024/06/03 by Worachead Sommanee, Sommanee, Worachead
Computer Science · Mathematics · #20M20 #FOS: Mathematics #Group Theory (math.GR) #Mathematical Control Systems and Analysis #Mathematical Dynamics and Fractals #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.2406.01015
openalex publication_date 2024/06/03 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Let Xn = \1,2,…,n\ be a finite set (n≥ 2) and Tn the full transformation semigroup on Xn. For a positive integer l≤ n-1, we define Tn(l) = \α∈ Tn \colon ∀ x,y∈ Xn, |x-y| = l ⇒ |xα- yα| = l\ and T^*n(l) = \α∈ Tn \colon ∀ x,y∈ Xn, |x-y| = l ⇔ |xα- yα| = l\. Then Tn(l) and T^*n(l) are subsemigroups of Tn. In this paper, we give a necessary and sufficient condition for Tn(l) to be regular. Moreover, we prove that T^*n(l) is a regular semigroup.