暂无分享,去创建一个
[1] Péter Gács,et al. Reliable computation with cellular automata , 1983, J. Comput. Syst. Sci..
[2] Leonid A. Levin,et al. Complex tilings , 2001, STOC '01.
[3] Pascal Vanier,et al. A note on Turing degree spectra of minimal subshifts , 2014, ArXiv.
[4] Pascal Vanier,et al. Turing degrees of multidimensional SFTs , 2011, Theor. Comput. Sci..
[5] Nathalie Aubrun,et al. Simulation of Effective Subshifts by Two-dimensional Subshifts of Finite Type , 2013, ArXiv.
[6] Symbolic dynamics , 2008, Scholarpedia.
[7] Sergey V. Avgustinovich,et al. Arithmetical Complexity of Infinite Words , 2003, Words, Languages & Combinatorics.
[8] Linda Brown Westrick. Seas of squares with sizes from a $\Pi^0_1$ set , 2016 .
[9] Pascal Vanier,et al. Turing Degree Spectra of Minimal Subshifts , 2017, CSR.
[10] Maxim Ushakov,et al. Forbidden Substrings, Kolmogorov Complexity and Almost Periodic Sequences , 2006, STACS.
[11] M. Hochman. On the dynamics and recursive properties of multidimensional symbolic systems , 2009 .
[12] Bruno Durand,et al. Tilings and Quasiperiodicity , 1997, Theor. Comput. Sci..
[13] Pavel Vadimovich Salimov. On Uniform Recurrence of a Direct Product , 2010, Discret. Math. Theor. Comput. Sci..
[14] Bruno Durand,et al. Quasiperiodicity and Non-computability in Tilings , 2015, MFCS.
[15] Alexander Shen,et al. Fixed-point tile sets and their applications , 2009, J. Comput. Syst. Sci..