Decidability problems in symbolic dynamics
Statement
Determine whether algorithms exist to: decide conjugacy of two SFTs; decide conjugacy of two two-sided or one-sided sofic shifts; compute the expansive component generated by an expansive SFT automorphism; and decide, for a surjective block code of a full shift, whether it has a continuous right inverse.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.