Complexity of Conjugacy, Factoring and Embedding for Countable Sofic Shifts of Rank 2

  title={Complexity of Conjugacy, Factoring and Embedding for Countable Sofic Shifts of Rank 2},
  author={Ville Salo and Ilkka T{\"o}rm{\"a}},
In this article, we study countable sofic shifts of Cantor-Bendixson rank at most 2. We prove that their conjugacy problem is complete for \(\mathsf {GI}\), the complexity class of graph isomorphism, and that the existence problems of block maps, factor maps and embeddings are \(\mathsf {NP}\)-complete. 
2 Citations



Hardness of conjugacy and factorization of multidimensional subshifts of finite type

The hardness of conjugacy and factorization of subshifts of finite type (SFTs) in dimension $d>1$ is investigated and it is proved that the factorization problem is $\Sigma^0_3$-complete and the conjugate problem is $Sigma$0_1-complete in the arithmetical hierarchy.

Computational Aspects of Cellular Automata on Countable Sofic Shifts

The Starfleet Lemma is proved, which is of independent interest, to prove the decidability of nilpotency and periodicity, the undecideability of stability of the limit set, and the existence of a $\mathrm{\Pi}^0_1$-complete limit set and a $0_3$- complete asymptotic set.

Structuring multi-dimensional subshifts

The simplest aperiodic configurations in countable SFTs are characterized, a combinatorial characterization of uncountable subshifts is given, and it is proved that some Cantor-Bendixson ranks are impossible for countableSFTs.

Classification of sofic projective subdynamics of multidimensional shifts of finite type

Motivated by Hochman’s notion of subdynamics of a Z subshift [8], we define and examine the projective subdynamics of Z shifts of finite type (SFTs) where we restrict not only the action but also the

Constructions with Countable Subshifts of Finite Type

We present constructions of countable two-dimensional subshifts of finite type SFTs with interesting properties. Our main focus is on properties of the topological derivatives and subpattern posets

On the graph isomorphism problem

We relate the graph isomorphism problem to the solvability of certain systems of linear equations and linear inequalities. The number of these equations and inequalities is related to the complexity

Computational complexity of graph compaction

We say that a graph is reflexive if each of its vertices has a loop, and irreflexive if none of its vertices has a loop. Any graph, in general, is said to be partially reflexive. In the following,

On the complexity of H-coloring

Algorithmic Graph Theory

Preface 1. Introducing graphs and algorithmic complexity 2. Spanning-trees, branchings and connectivity 3. Planar graphs 4. Networks and flows 5. Matchings 6. Eulerian and Hamiltonian tours 7.

The Graph Isomorphism Problem

A highlight of the conference was the presentation of a new quasi-polynomial time algorithm for the Graph Isomorphism Problem, providing the first improvement since 1983.