Complexity of cutting words on regular tilings

: We show that the complexity of a cutting word u in a regular tiling by a polyomino Q is equal to Pn(u) = (p+q−1)n+1 for all n ≥ 0, where Pn(u) counts the number of distinct factors of length n in the infinite word u and where the boundary of Q is constructed by 2p horizontal and 2q vertical unit segments.

• Type: Journal
• Year: 2007
• Where: EJC
• Authors: Pascal Hubert, Laurent Vuillon
• Keywords: Distinct Factors, EJC 2007, Information Technology, Infinite Word, Polyomino