Soficity preservation under the induction operation
Let , , , and satisfy the hypotheses of Lemma~, and let denote the induction operation. A subshift is sofic if it is the image of a shift of finite type under a uniformly local definable map. Soficity induction conjecture. If is a sofic shift, then is a sofic shift.
The preceding theorem proves this when the induction of every shift of finite type is again a shift of finite type. The conjecture asserts that this extra hypothesis is redundant.
References
Primary source
Silvio Capobianco, “On the Induction Operation for Shift Subspaces and Cellular Automata as Presentations of Dynamical Systems”, arXiv:0711.3841 (2008).
Progress summary
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.