Aperiodic Tilings V: the Refinable Frontier
Read OriginalThis technical article, part of a series on aperiodic tilings, addresses the challenge of ambiguous substitution systems that prevent the construction of deterministic finite-state transducers for coordinate tracking. It details a method to algorithmically refine such systems into unambiguous versions, allowing for reliable tiling generation and neighbor-finding, with examples applied to known aperiodic sets like the Spectre and hat tilings.
Comments
No comments yet
Be the first to share your thoughts!
Browser Extension
Get instant access to AllDevBlogs from your browser
Top of the Week
1
The Beautiful Web
Jens Oliver Meiert
•
2 votes
2
When your coding agent doesn’t understand your project, you’ll get junk
Benjamin Cane
•
1 votes
3
LLM Use in the Python Source Code
Miguel Grinberg
•
1 votes
4
Wagon’s algorithm in Python
John D. Cook
•
1 votes
5
An example conversation with Claude Code
Dumm Zeuch
•
1 votes