Universal Tilings

DOI10.1007/978-3-540-70918-3_32MaRDI QIDQ3590947zbMATH OpenOpenAlexFDO

Authors Grégory Lafitte, Michael Weiss

Publication date 3 September 2007

Published in STACS 2007 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-70918-3_32

Mathematics Subject Classification ID

Combinatorial aspects of tessellation and tiling problems (05B45) Combinatorics in computer science (68R05)

Recommendations

• Tilings: simulation and universality
• An Almost Totally Universal Tile Set
• Fixed parameter undecidability for Wang tilesets
• scientific article; zbMATH DE number 1101596
• scientific article; zbMATH DE number 1948487

Cited in

(15)

• Universal tilings and universal (0,1)-matrices
• Universal karyon tilings
• The two-handed tile assembly model is not intrinsically universal
• On the cost of simulating a parallel Boolean automata network by a block-sequential one
• Tilings: simulation and universality
• A Topological Study of Tilings
• Constructing new aperiodic self-simulating tile sets
• An Almost Totally Universal Tile Set
• A universal lattice
• scientific article; zbMATH DE number 1948487 (Why is no real title available?)
• scientific article; zbMATH DE number 2119689 (Why is no real title available?)
• Fixed parameter undecidability for Wang tilesets
• UNIVERSAL TRELLISES
• Wang tilings and distributed verification on anonymous torus networks
• Universal tilings of the plane by 0-1 -matrices

This page was built for publication: Universal Tilings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3590947)