Durand, Bruno; Romashchenko, Andrei The expressiveness of quasiperiodic and minimal shifts of finite type. (English) Zbl 07317322 Ergodic Theory Dyn. Syst. 41, No. 4, 1086-1138 (2021). MSC: 37B52 37B51 37B10 03D80 52C23 PDF BibTeX XML Cite \textit{B. Durand} and \textit{A. Romashchenko}, Ergodic Theory Dyn. Syst. 41, No. 4, 1086--1138 (2021; Zbl 07317322) Full Text: DOI
Pavlov, Ronnie; Vanier, Pascal The relationship between word complexity and computational complexity in subshifts. (English) Zbl 07314925 Discrete Contin. Dyn. Syst. 41, No. 4, 1627-1648 (2021). MSC: 37B10 03D15 03D40 08A50 PDF BibTeX XML Cite \textit{R. Pavlov} and \textit{P. Vanier}, Discrete Contin. Dyn. Syst. 41, No. 4, 1627--1648 (2021; Zbl 07314925) Full Text: DOI
McGoff, Kevin; Pavlov, Ronnie Factor maps and embeddings for random \(\mathbb{Z}^d\) shifts of finite type. (English) Zbl 1419.37018 Isr. J. Math. 230, No. 1, 239-273 (2019). Reviewer: Ivan Podvigin (Novosibirsk) MSC: 37B50 37B10 PDF BibTeX XML Cite \textit{K. McGoff} and \textit{R. Pavlov}, Isr. J. Math. 230, No. 1, 239--273 (2019; Zbl 1419.37018) Full Text: DOI arXiv
Durand, Bruno; Romashchenko, Andrei On the expressive power of quasiperiodic SFT. (English) Zbl 1441.37021 Larsen, Kim G. (ed.) et al., 42nd international symposium on mathematical foundations of computer science, MFCS 2017, August 21–25, 2017, Aalborg, Denmark. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 83, Article 5, 14 p. (2017). MSC: 37B51 03D45 68Q30 PDF BibTeX XML Cite \textit{B. Durand} and \textit{A. Romashchenko}, LIPIcs -- Leibniz Int. Proc. Inform. 83, Article 5, 14 p. (2017; Zbl 1441.37021) Full Text: DOI
Hochman, Michael; Vanier, Pascal Turing degree spectra of minimal subshifts. (English) Zbl 06763503 Weil, Pascal (ed.), Computer science – theory and applications. 12th international computer science symposium in Russia, CSR 2017, Kazan, Russia, June 8–12, 2017. Proceedings. Cham: Springer (ISBN 978-3-319-58746-2/pbk; 978-3-319-58747-9/ebook). Lecture Notes in Computer Science 10304, 154-161 (2017). MSC: 68Qxx PDF BibTeX XML Cite \textit{M. Hochman} and \textit{P. Vanier}, Lect. Notes Comput. Sci. 10304, 154--161 (2017; Zbl 06763503) Full Text: DOI
Jeandel, Emmanuel Computability in symbolic dynamics. (English) Zbl 06617639 Beckmann, Arnold (ed.) et al., Pursuit of the universal. 12th conference on computability in Europe, CiE 2016, Paris, France, June 27 – July 1, 2016. Proceedings. Cham: Springer (ISBN 978-3-319-40188-1/pbk; 978-3-319-40189-8/ebook). Lecture Notes in Computer Science 9709, 124-131 (2016). MSC: 68Qxx PDF BibTeX XML Cite \textit{E. Jeandel}, Lect. Notes Comput. Sci. 9709, 124--131 (2016; Zbl 06617639) Full Text: DOI
Jeandel, Emmanuel; Vanier, Pascal Hardness of conjugacy, embedding and factorization of multidimensional subshifts. (English) Zbl 1328.68074 J. Comput. Syst. Sci. 81, No. 8, 1648-1664 (2015). MSC: 68Q17 37B50 PDF BibTeX XML Cite \textit{E. Jeandel} and \textit{P. Vanier}, J. Comput. Syst. Sci. 81, No. 8, 1648--1664 (2015; Zbl 1328.68074) Full Text: DOI
Cenzer, Douglas; Dashti, Ali; Toska, Ferit; Wyman, Sebastian Computability of countable subshifts in one dimension. (English) Zbl 1285.03055 Theory Comput. Syst. 51, No. 3, 352-371 (2012). MSC: 03D30 03D78 37B10 PDF BibTeX XML Cite \textit{D. Cenzer} et al., Theory Comput. Syst. 51, No. 3, 352--371 (2012; Zbl 1285.03055) Full Text: DOI