2 problems

Eventual flow equivalence conjecture for Sturmian systems
Let $(X_{\alpha},\operatorname{\sigma}_{\alpha})$ and $(X_{\beta},\operatorname{\sigma}_{\beta})$ be Sturmian systems. Sturmian eventual-flow conjecture. Eventual flow equivalence…
openflow-equivalence sturmian-systems symbolic-dynamics
0 responses
06
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 concate…
openflow-equivalence shifts-of-finite-type symbolic-dynamics
0 responses
04

Eventual flow equivalence conjecture for Sturmian systems