A Numeration System for Fibonacci-like Wang Shifts

DOI10.1007/978-3-030-85088-3_9MaRDI QIDQ6368484arXivFDO

Authors Sébastien Labbé, Jana Lepšová

Publication date 25 May 2021

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Abstract: Motivated by the study of Fibonacci-like Wang shifts, we define a numeration system for $mathbbZ$ and $mathbb{Z}^2$ based on the binary alphabet $0,1$. We introduce a set of 16 Wang tiles that admits a valid tiling of the plane described by a deterministic finite automaton taking as input the representation of a position $(m,n)inmathbb{Z}^2$ and outputting a Wang tile.

This page was built for publication: A Numeration System for Fibonacci-like Wang Shifts

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