2015/01/10 by Mahsa Allahbakhshi, Allahbakhshi, Mahsa, Soonjo Hong +3
Computer Science · Engineering · Mathematics · #37B10 #Cellular Automata and Applications #Coding theory and cryptography #Dynamical Systems (math.DS) #FOS: Mathematics #graph theory and CDMA systems #math.DS #msc:37B10 #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.1501.02384
submitted
openalex publication_date 2015/01/10 · arxiv created 2015/01/29 · arxiv updated 2015/01/30 · openalex created_date 2022/10/02 · openalex updated_date 2026/07/28
We define class-closing factor codes from shifts of finite type and show that they are continuing if their images are of finite type. We establish several relations between class-closing factor codes, continuing factor codes and constant-class-to-one factor codes. In particular it is shown that a factor code between irreducible shifts of finite type is constant-class-to-one if and only if it is bi-class-closing, generalizing a result of Nasu.