Decidability of locally testable model checking for countable quasiminimal subshifts
Let be a countable quasiminimal recursive subshift. The model-checking problem asks whether the language of intersects a given formal language. Locally testable decidability conjecture. The model-checking problem of for locally testable languages is decidable. The conjecture proposes a general decidability result for locally testable languages in the countable case. The surrounding text notes related decidability results for starfree languages but gives no resolution of this stronger claim.
References
- Ville Salo, “Decidability and Universality of Quasiminimal Subshifts”, arXiv:1411.6644 (2015).
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.