An Almost Totally Universal Tile Set

DOI10.1007/978-3-642-02017-9_30zbMath1241.68065OpenAlexW1567758213MaRDI QIDQ3630212

Michael Weiss, Grégory Lafitte

Publication date: 3 June 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02017-9_30

Mathematics Subject Classification ID

Combinatorial aspects of tessellation and tiling problems (05B45)

Related Items (2)

On the Cost of Simulating a Parallel Boolean Automata Network by a Block-Sequential One ⋮ The two-handed tile assembly model is not intrinsically universal

This page was built for publication: An Almost Totally Universal Tile Set