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


In this article, we study countable sofic shifts of CantorBendixson rank at most 2. We prove that their conjugacy problem is complete for GI, the complexity class of graph isomorphism, and that the existence problems of block maps, factor maps and embeddings are NP-complete. 
DOI: 10.1007/978-3-319-18812-6_10


1 Figure or Table