Self-Similar Tiling Systems, Topological Factors and Stretching Factors

1. Bès, A.: An extension of the Cobham–Semënov theorem. J. Symb. Log. 65, 201–211 (2000)

   Article  MATH  Google Scholar 

2. Bruyère, V., Hansel, G.: In: Recognizable Sets of Numbers in Nonstandard Bases. Lecture Notes in Comput. Sci., vol. 911, pp. 167–179. Springer, Berlin (1995)

   Google Scholar 

3. Bruyère, V., Hansel, G.: Bertrand numeration systems and recognizability. Theor. Comput. Sci. 181, 17–43 (1997). Latin American Theoretical Informatics (Valparaíso, 1995)

   Article  MATH  Google Scholar 

4. Bruyère, V., Hansel, G., Michaux, C., Villemaire, R.: Logic and p-recognizable sets of integers. Bull. Belg. Math. Soc. S. Stevin 1, 191–238 (1994)

   MATH  Google Scholar 

5. Cobham, A.: On the base-dependence of sets of numbers recognizable by finite automata. Math. Syst. Theory 3, 186–192 (1969)

   Article  MATH  MathSciNet  Google Scholar 

6. Cobham, A.: Uniform tag sequences. Math. Syst. Theory 6, 164–192 (1972)

   Article  MATH  MathSciNet  Google Scholar 

7. Durand, F.: Sur les ensembles d’entiers reconnaissables. J. Théor. Nombres Bordeaux 10, 65–84 (1998)

   MATH  MathSciNet  Google Scholar 

8. Durand, F.: A generalization of Cobham’s theorem. Theory Comput. Syst. 31, 169–185 (1998)

   Article  MATH  MathSciNet  Google Scholar 

9. Durand, F.: A theorem of Cobham for non-primitive substitutions. Acta Arith. 104, 225–241 (2002)

   Article  MATH  MathSciNet  Google Scholar 

10. Eilenberg, S.: Automata, Languages, and Machines, vol. A. Pure and Applied Mathematics, vol. 58. Academic Press, New York (1974)

    MATH  Google Scholar 

11. Fabre, S.: Une généralisation du théorème de Cobham. Acta Arith. 67, 197–208 (1994)

    MATH  MathSciNet  Google Scholar 

12. Fagnot, I.: Sur les facteurs des mots automatiques. Theor. Comput. Sci. 172, 67–89 (1997)

    Article  MATH  MathSciNet  Google Scholar 

13. Hansel, G.: A propos d’un théorème de Cobham. In: Perrin, D. (ed.) Actes de la Fête des Mots. GRECO de Programmation, Rouen (1982)

14. Hansel, G.: Systèmes de numération indépendants et syndéticité. Theor. Comput. Sci. 204, 119–130 (1998)

    Article  MATH  MathSciNet  Google Scholar 

15. Holton, C., Zamboni, L.: Directed graphs and substitutions. Theor. Comput. Syst. 34, 545–564 (2001)

    MATH  MathSciNet  Google Scholar 

16. Holton, C., Radin, C., Sadun, L.: Conjugacies for tiling dynamical systems. Commun. Math. Phys. 254(2), 343–359 (2005)

    Article  MATH  MathSciNet  Google Scholar 

17. Michaux, C., Villemaire, R.: Presburger arithmetic and recognizability of sets of natural numbers by automata: new proofs of Cobham’s theorem and Semenov’s theorem. Ann. Pure Appl. Log. 77, 251–277 (1996)

    Article  MATH  MathSciNet  Google Scholar 

18. Petersen, K.: Factor maps between tiling dynamical systems. Forum Math. 11(4), 503–512 (1999)

    Article  MATH  MathSciNet  Google Scholar 

19. Radin, C., Sadun, L.: Isomorphism of hierarchical structures. Ergod. Theor. Dyn. Syst. 21(4), 1239–1248 (2001)

    Article  MATH  MathSciNet  Google Scholar 

20. Rudolph, D.J.: Markov tilings of R ⁿ and representations of R ⁿ actions. In: Measure and Measurable Dynamics, Rochester, NY, 1987. Contemp. Math., vol. 94, pp. 271–290. Amer. Math. Soc., Providence (1989)

    Google Scholar 

21. Semenov, A.L.: The Presburger nature of predicates that are regular in two number systems. Sib. Math. J. 18, 289–299 (1977)

    Article  MATH  Google Scholar 

22. Solomyak, B.: Dynamics of self-similar tilings. Ergod. Theory Dyn. Syst. 17, 695–738 (1997)

    Article  MATH  MathSciNet  Google Scholar 

23. Solomyak, B.: Nonperiodicity implies unique composition for self-similar translationally finite tilings. Discrete Comput. Geom. 20, 265–279 (1998)

    Article  MATH  MathSciNet  Google Scholar 

Download references