scientific article; zbMATH DE number 1500538
From MaRDI portal
Publication:4501557
zbMATH Open0953.03055MaRDI QIDQ4501557FDOQ4501557
Authors: Julien Cervelle, Bruno Durand 
Publication date: 29 January 2001
Title of this publication is not available (Why is that?)
Recommendations
Combinatorial aspects of tessellation and tiling problems (05B45) Cellular automata (computational aspects) (68Q80) Recursive functions and relations, subrecursive hierarchies (03D20) Undecidability and degrees of sets of sentences (03D35)
Cited In (20)
- From logic to tiling
- An order on sets of tilings corresponding to an order on languages
- Quasiperiodicity and non-computability in tilings
- On two questions concerning tilings
- On additive property of the complexity function related to Rauzy tiling
- Regular production systems and triangle tilings
- Tiling Turán theorems
- Number-conserving cellular automata I: Decidability.
- Tilings and quasiperiodicity.
- Quasi-periodic configurations and undecidable dynamics for tilings, infinite words and Turing machines
- Periodicity in tilings
- Title not available (Why is that?)
- Reversibility and foldability of Conway tiles
- Tilings and quasiperiodicity
- Title not available (Why is that?)
- Complex tilings
- Tilings robust to errors
- Complex tilings
- Tilings: recursivity and regularity
- Title not available (Why is that?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4501557)
