{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,2]],"date-time":"2026-03-02T06:30:28Z","timestamp":1772433028920,"version":"3.50.1"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2008,10,2]],"date-time":"2008-10-02T00:00:00Z","timestamp":1222905600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[2008,12]]},"DOI":"10.1007\/s00454-008-9108-4","type":"journal-article","created":{"date-parts":[[2008,10,1]],"date-time":"2008-10-01T19:42:24Z","timestamp":1222890144000},"page":"622-640","source":"Crossref","is-referenced-by-count":2,"title":["Self-Similar Tiling Systems, Topological Factors and\u00a0Stretching Factors"],"prefix":"10.1007","volume":"40","author":[{"given":"Mar\u00eda Isabel","family":"Cortez","sequence":"first","affiliation":[]},{"given":"Fabien","family":"Durand","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,10,2]]},"reference":[{"key":"9108_CR1","doi-asserted-by":"crossref","first-page":"201","DOI":"10.2307\/2586532","volume":"65","author":"A. B\u00e8s","year":"2000","unstructured":"B\u00e8s, A.: An extension of the Cobham\u2013Sem\u00ebnov theorem. J. Symb. Log. 65, 201\u2013211 (2000)","journal-title":"J. Symb. Log."},{"key":"9108_CR2","series-title":"Lecture Notes in Comput. Sci.","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/3-540-59175-3_87","volume-title":"Recognizable Sets of Numbers in Nonstandard Bases","author":"V. Bruy\u00e8re","year":"1995","unstructured":"Bruy\u00e8re, V., Hansel, G.: In: Recognizable Sets of Numbers in Nonstandard Bases. Lecture Notes in Comput. Sci., vol. 911, pp. 167\u2013179. Springer, Berlin (1995)"},{"key":"9108_CR3","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/S0304-3975(96)00260-5","volume":"181","author":"V. Bruy\u00e8re","year":"1997","unstructured":"Bruy\u00e8re, V., Hansel, G.: Bertrand numeration systems and recognizability. Theor. Comput. Sci. 181, 17\u201343 (1997). Latin American Theoretical Informatics (Valpara\u00edso, 1995)","journal-title":"Theor. Comput. Sci."},{"key":"9108_CR4","doi-asserted-by":"crossref","first-page":"191","DOI":"10.36045\/bbms\/1103408547","volume":"1","author":"V. Bruy\u00e8re","year":"1994","unstructured":"Bruy\u00e8re, V., Hansel, G., Michaux, C., Villemaire, R.: Logic and p-recognizable sets of integers. Bull. Belg. Math. Soc. S. Stevin 1, 191\u2013238 (1994)","journal-title":"Bull. Belg. Math. Soc. S. Stevin"},{"key":"9108_CR5","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1007\/BF01746527","volume":"3","author":"A. Cobham","year":"1969","unstructured":"Cobham, A.: On the base-dependence of sets of numbers recognizable by finite automata. Math. Syst. Theory 3, 186\u2013192 (1969)","journal-title":"Math. Syst. Theory"},{"key":"9108_CR6","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1007\/BF01706087","volume":"6","author":"A. Cobham","year":"1972","unstructured":"Cobham, A.: Uniform tag sequences. Math. Syst. Theory 6, 164\u2013192 (1972)","journal-title":"Math. Syst. Theory"},{"key":"9108_CR7","doi-asserted-by":"crossref","first-page":"65","DOI":"10.5802\/jtnb.219","volume":"10","author":"F. Durand","year":"1998","unstructured":"Durand, F.: Sur les ensembles d\u2019entiers reconnaissables. J. Th\u00e9or. Nombres Bordeaux 10, 65\u201384 (1998)","journal-title":"J. Th\u00e9or. Nombres Bordeaux"},{"key":"9108_CR8","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/s002240000084","volume":"31","author":"F. Durand","year":"1998","unstructured":"Durand, F.: A generalization of Cobham\u2019s theorem. Theory Comput. Syst. 31, 169\u2013185 (1998)","journal-title":"Theory Comput. Syst."},{"key":"9108_CR9","doi-asserted-by":"crossref","first-page":"225","DOI":"10.4064\/aa104-3-2","volume":"104","author":"F. Durand","year":"2002","unstructured":"Durand, F.: A theorem of Cobham for non-primitive substitutions. Acta Arith. 104, 225\u2013241 (2002)","journal-title":"Acta Arith."},{"key":"9108_CR10","series-title":"Pure and Applied Mathematics","volume-title":"Automata, Languages, and Machines, vol. A","author":"S. Eilenberg","year":"1974","unstructured":"Eilenberg, S.: Automata, Languages, and Machines, vol. A. Pure and Applied Mathematics, vol. 58. Academic Press, New York (1974)"},{"key":"9108_CR11","doi-asserted-by":"crossref","first-page":"197","DOI":"10.4064\/aa-67-3-197-208","volume":"67","author":"S. Fabre","year":"1994","unstructured":"Fabre, S.: Une g\u00e9n\u00e9ralisation du th\u00e9or\u00e8me de Cobham. Acta Arith. 67, 197\u2013208 (1994)","journal-title":"Acta Arith."},{"key":"9108_CR12","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/S0304-3975(96)00239-3","volume":"172","author":"I. Fagnot","year":"1997","unstructured":"Fagnot, I.: Sur les facteurs des mots automatiques. Theor. Comput. Sci. 172, 67\u201389 (1997)","journal-title":"Theor. Comput. Sci."},{"key":"9108_CR13","unstructured":"Hansel, G.: A propos d\u2019un th\u00e9or\u00e8me de Cobham. In: Perrin, D. (ed.) Actes de la F\u00eate des Mots. GRECO de Programmation, Rouen (1982)"},{"key":"9108_CR14","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/S0304-3975(98)00035-8","volume":"204","author":"G. Hansel","year":"1998","unstructured":"Hansel, G.: Syst\u00e8mes de num\u00e9ration ind\u00e9pendants et synd\u00e9ticit\u00e9. Theor. Comput. Sci. 204, 119\u2013130 (1998)","journal-title":"Theor. Comput. Sci."},{"key":"9108_CR15","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1007\/s00224-001-1038-y","volume":"34","author":"C. Holton","year":"2001","unstructured":"Holton, C., Zamboni, L.: Directed graphs and substitutions. Theor. Comput. Syst. 34, 545\u2013564 (2001)","journal-title":"Theor. Comput. Syst."},{"issue":"2","key":"9108_CR16","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1007\/s00220-004-1195-3","volume":"254","author":"C. Holton","year":"2005","unstructured":"Holton, C., Radin, C., Sadun, L.: Conjugacies for tiling dynamical systems. Commun. Math. Phys. 254(2), 343\u2013359 (2005)","journal-title":"Commun. Math. Phys."},{"key":"9108_CR17","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/0168-0072(95)00022-4","volume":"77","author":"C. Michaux","year":"1996","unstructured":"Michaux, C., Villemaire, R.: Presburger arithmetic and recognizability of sets of natural numbers by automata: new proofs of Cobham\u2019s theorem and Semenov\u2019s theorem. Ann. Pure Appl. Log. 77, 251\u2013277 (1996)","journal-title":"Ann. Pure Appl. Log."},{"issue":"4","key":"9108_CR18","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1515\/form.1999.011","volume":"11","author":"K. Petersen","year":"1999","unstructured":"Petersen, K.: Factor maps between tiling dynamical systems. Forum Math. 11(4), 503\u2013512 (1999)","journal-title":"Forum Math."},{"issue":"4","key":"9108_CR19","doi-asserted-by":"crossref","first-page":"1239","DOI":"10.1017\/S0143385701001572","volume":"21","author":"C. Radin","year":"2001","unstructured":"Radin, C., Sadun, L.: Isomorphism of hierarchical structures. Ergod. Theor. Dyn. Syst. 21(4), 1239\u20131248 (2001)","journal-title":"Ergod. Theor. Dyn. Syst."},{"key":"9108_CR20","series-title":"Contemp. Math.","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1090\/conm\/094\/1012996","volume-title":"Measure and Measurable Dynamics","author":"D.J. Rudolph","year":"1989","unstructured":"Rudolph, D.J.: Markov tilings of R n and representations of R n actions. In: Measure and Measurable Dynamics, Rochester, NY, 1987. Contemp. Math., vol. 94, pp. 271\u2013290. Amer. Math. Soc., Providence (1989)"},{"key":"9108_CR21","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1007\/BF00967164","volume":"18","author":"A.L. Semenov","year":"1977","unstructured":"Semenov, A.L.: The Presburger nature of predicates that are regular in two number systems. Sib. Math. J. 18, 289\u2013299 (1977)","journal-title":"Sib. Math. J."},{"key":"9108_CR22","doi-asserted-by":"crossref","first-page":"695","DOI":"10.1017\/S0143385797084988","volume":"17","author":"B. Solomyak","year":"1997","unstructured":"Solomyak, B.: Dynamics of self-similar tilings. Ergod. Theory Dyn. Syst. 17, 695\u2013738 (1997)","journal-title":"Ergod. Theory Dyn. Syst."},{"key":"9108_CR23","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/PL00009386","volume":"20","author":"B. Solomyak","year":"1998","unstructured":"Solomyak, B.: Nonperiodicity implies unique composition for self-similar translationally finite tilings. Discrete Comput. Geom. 20, 265\u2013279 (1998)","journal-title":"Discrete Comput. Geom."}],"container-title":["Discrete &amp; Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-008-9108-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00454-008-9108-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-008-9108-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,8]],"date-time":"2020-05-08T19:36:15Z","timestamp":1588966575000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00454-008-9108-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,10,2]]},"references-count":23,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2008,12]]}},"alternative-id":["9108"],"URL":"https:\/\/doi.org\/10.1007\/s00454-008-9108-4","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"value":"0179-5376","type":"print"},{"value":"1432-0444","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,10,2]]}}}