Pseudo-cyclic renewal systems (Q719279)

Let \(W\) be a finite set of words over an alphabet. In this paper, the notions of bifix-free sets and semi- (or semi*-)cyclic sets are introduced. The author shows that \(W\) is bifix-free (or semi-cyclic) if and only if it is pseudo-cyclic. Also, the notions of fiber mixing and circular- (or circular*-) mixing maps are given. The author proves that the function \(\varphi\) is fiber-mixing (or circular-mixing) if and only if \(W\) is pseudo-cyclic. The author proves that the following are equivalent: (i) \(W\) is pseudo-cyclic; (ii) \(W\) is bifix-free; (iii) \(W\) is semi-cyclic; (iv) \(W\) is semi*-cyclic; (v) \(\varphi\) is fiber-mixing; (vi) \(\varphi\) is circular*-mixing; (vii) \(\varphi\) is circular-mixing. The author studies \(P\)-fiber-mixing and \(p\)-circular-mixing maps. Therefore, a periodic version of the above results is given. It is proved that the following are equivalent: (i) \(W\) is \(p\)-semi-cyclic; (ii) \(\varphi\) is \(p\)-fiber-mixing; (iii) \(\varphi\) is \(p\)-circular*-mixing; (iv) \(\varphi\) is \(p\)-circular-mixing. Also, the author asks whether every irreducible shift of finite type is conjugate to a renewal system (sofic shifts).