![]() 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. In: Second Symposium on Cellular Automata (JAC) (2010)Ĭenzer, D., Dashti, A., King, J.L.F.: Computable symbolic dynamics. 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. Aubrun, N., Sablik, M.: Simulation of effective subshifts by two-dimensional subshifts of finite type.
0 Comments
Leave a Reply. |