Representation of Ammann-Beenker tilings by an automaton (Q1769939)

The Ammann-Beenker tilings are quasiperiodic tilings of the plane with rhombs (with acute angles \(45^\circ\)) and squares with the same lengths of their edges. They can be constructed by decorating the edges of tiles and combining them such that certain restrictions (Ammann's matching rules) are satisfied along the common edges of adjacent tiles. The authors present an alternate construction based on two decorated rhombs (\(A\) and \(B\)), two decorated triangles (\(C\) and \(D\)) and the up-down generation method. The decorated tiles \(A,\;B,\;C\) and \(D\) are subdivided by using smaller similar decorated tiles and some matching rules. If a tile similar to \(X\in \{ A,B,C,D\}\) occurs in a subdivision of \(Y\in \{ A,B,C,D\}\) then the authors say that there is a transition map from \(X\) to \(Y\). They prove in this way that Ammann-Beenker tilings can be represented by an automaton with 4 states and 24 transition maps.