Flow-equivalence conjecture for irreducible shifts of finite type and renewal systems
An irreducible shift of finite type (SFT) is an irreducible symbolic dynamical system defined by finitely many forbidden words, and a renewal system is a shift generated by concatenations of a finite collection of words. Flow-equivalence conjecture. Every irreducible SFT is flow equivalent to a renewal system.
References
Status
- Solved: Rune Johansen. Flow equivalence of renewal systems (Ergodic Theory and Dynamical Systems, 2016) https://doi.org/10.1017/etds.2015.48
Source: Rune Johansen, “On Flow Equivalence of Sofic Shifts”, arXiv:1210.3048 (2012).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.