Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl (2016). (eds.) 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016), Leibniz International Proceedings in Informatics (LIPIcs), vol. In: Chatzigiannakis, I., Mitzenmacher, M., Rabani, Y., Sangiorgi, D. Sablik, M., Schraudner, M.: Algorithmic complexity for the realization of an effective subshift by a sofic. In: Ergodic Theory and Dynamical Systems (2011) Simpson, S.G.: Medvedev degrees of 2-dimensional subshifts of finite type. Rogers Jr., H.: Theory of Recursive Functions and Effective Computability. Myers, D.: Non recursive tilings of the plane II. Morse, H.M., Hedlund, G.A.: Symbolic dynamics II. Cambridge University Press, New York (1995) Lind, D., Marcus, B.: An Introduction to Symbolic Dynamics and Coding. Kent, T., Lewis, A.E.M.: On the degree spectrum of a \(\) class. Theory and Applications of Models of Computation 2011, pp. Jeandel, E., Vanier, P.: Turing degrees of multidimensional SFTs. Turku Center for Computer Science (2010). Jeandel, E., Vanier, P.: Slopes of tilings. Hochman, M.: On the dynamics, recursive properties of multidimensional symbolic systems. Hochman, M., Meyerovitch, T.: A characterization of the entropies of multidimensional shifts of finite type. Hanf, W.: Non recursive tilings of the plane I. (ed.) Proceedings 18th International Workshop on Cellular Automata and Discrete Complex Systems and 3rd International Symposium Journées Automates Cellulaires (AUTOMATA & JAC 2012), La Marana, Corsica, 19–21 September 2012, vol. doi: 10.1007/978-5-8_12įernique, T., Sablik, M.: Local rules for computable planar tilings. In: Blass, A., Dershowitz, N., Reisig, W. doi: 10.1007/s0022-zĭurand, B., Romashchenko, A., Shen, A.: Effective closed subshifts in 1D can be implemented in 2D. doi: 10.1007/978-2-8_10Ĭenzer, D., Dashti, A., Toska, F., Wyman, S.: Computability of countable subshifts in one dimension. In: Ferreira, F., Löwe, B., Mayordomo, E., Mendes Gomes, L. doi: 10.1002/malq.200710066Ĭenzer, D., Dashti, A., Toska, F., Wyman, S.: Computability of countable subshifts. We combine the previous results about domino tilings to show that our subshift of finite type has a measure of maximal entropy with which the subshift has completely positive entropy but is not isomorphic to a Bernoulli shift. In: Second Symposium on Cellular Automata (JAC) (2010)Ĭenzer, D., Dashti, A., King, J.L.F.: Computable symbolic dynamics. We construct a subshift of finite type using matching rules for several types of dominos. Bulletin de la SMF 40, 305–323 (1912)īallier, A., Jeandel, E.: Computing (or not) quasi-periodicity functions of tilings. 1007, doi: 10.1007/s1044-5, īirkhoff, M.-G.D.: Quelques théorèmes sur le mouvement des systèmes dynamiques. 195–206.Aubrun, N., Sablik, M.: Simulation of effective subshifts by two-dimensional subshifts of finite type. Vershik, A theorem on periodical Markov approximation in ergodic theory, Ergodic Theory and Related Topics (Vitte, 1981), Akademie-Verlag, Berlin, 1982, pp. Queffélec, SubstitutionDynamical Systems-Spectral Analysis, Lecture Notes in Mathematics, vol. Siegel) Lecture Notes in Mathematics, vol. Pytheas-Fogg, Substitutions in Dynamics, Arithmetics and Combinatorics, (ed.
![finite minimal subshift finite minimal subshift](https://web.archive.org/web/20160620092043im_/https://dl.dropboxusercontent.com/u/5390048/Root47.jpg)
Pansiot, Complexité des facteurs des mots infinis engenderé par morphismes ité rés, in Automata, Languages and Programming (Antwerp, 1984), Lecture Notes in Comput. Marcus, An Introduction to Symbolic Dynamics and Coding, Cambridge University Press, Cambridge, 1999. Skau, Ordered Bratteli diagrams, dimension groups and topological dynamics, Internat. Roychowdhury, Finitary orbit equivalence and measured Bratteli diagrams, Colloq. Halmos, Measure Theory, Springer-Verlag, New York, 1974. thesis, Norwegian University of Science and Technology, 1998. Gjerde, Bratteli Diagrams and Dimension Groups: Applications to the Theory of Symbolic Dynamical Systems, Ph.D. Skau, Topological orbit equivalence and C*-crossed products, J. Forrest, K-groups associated with substitution minimal systems, Israel J. Ferenczi, Substitution dynamical systems on infinite alphabets, Ann. Rozenberg, Subword complexities of various classes of deterministic developmental languages without interactions, Theoret.
![finite minimal subshift finite minimal subshift](https://i.stack.imgur.com/sCQEkm.jpg)
Skau, Substitutional dynamical systems, Bratteli diagrams and dimension groups, Ergodic Theory Dynam. Danilenko, Strong orbit equivalence of locally compact Cantor minimal systems, Internat.