Self-similarity viewed as a local property via tile sets

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1113, Issue , 1996, Pages 312-323

  Durand, Bruno ^a  

^a UNIV LYON   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

CONTRACTIVE TRANSFORMATION; FINITE NUMBER; ITERATED FUNCTION SYSTEM; LOCAL PROPERTY; LOCAL RULES; NON-TRIVIAL; SELF-SIMILAR; SELF-SIMILARITIES;

ARTIFICIAL INTELLIGENCE;

EID: 21444444870     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61550-4_158     Document Type: Conference Paper

References (8)

1. M. Barsnley. Fractals everywhere. Academic press, 1988.
2. R. Berger. The undecidability of the domino problem. Memoirs of the American Mathematical Society, 66, 1966.
3. J. Hutchinson. Fractal and self-similarity. Indiana Univ. Journal of Mathematics, 30(5):713-747, 1981.
4. K. Ingersent. Matching rules for quasicrystalline tilings, pages 185-212. World Scientific, 1991.
5. J. Kari. Reversibility and surjectivity problems of cellular automata. Journal of Computer and System Sciences, 48:149-182, 1994.
6. L. S. Levitov. Commun. Math. Phys., 119(627), 1988.
7. J. Mazoyer. Cellular automata and tilings. In D. Beauquier, editor, Actes des journées "Polyominos et Pavages", Université Paris XII - Val de Marne., 1991.
8. R.M. Robinson. Undecidability and nonperiodicity for tilings of the plane. Inventiones Mathematicae, 12:177-209, 1971.