Cantor-Bendixson ranks of countable SFTs
Ilkka T\"orm\"a

TL;DR
This paper characterizes the possible Cantor-Bendixson ranks of countable subshifts of finite type, showing they are exactly finite ordinals and certain computable ordinals, correcting a previous proof.
Contribution
It provides a complete characterization of Cantor-Bendixson ranks for countable SFTs and fixes an error in the author's earlier proof.
Findings
Ranks are exactly finite ordinals and ordinals of the form λ+3 for computable λ
Corrects a previous proof regarding these ranks
Clarifies the structure of countable SFTs in terms of Cantor-Bendixson analysis
Abstract
We show that the possible Cantor-Bendixson ranks of countable SFTs are exactly the finite ordinals and ordinals of the form , where is a computable ordinal. This result was claimed by the author in his PhD dissertation, but the proof contains an error, which is fixed in this note.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms · Cellular Automata and Applications · semigroups and automata theory
