Journal
EUROPEAN JOURNAL OF COMBINATORICS
Volume 28, Issue 1, Pages 429-438Publisher
ACADEMIC PRESS LTD- ELSEVIER SCIENCE LTD
DOI: 10.1016/j.ejc.2005.05.009
Keywords
-
Categories
Ask authors/readers for more resources
We show that the complexity of a cutting word u in a regular tiling with a polyomino Q is equal to P-n (u) = (p + q - 1)n + I for all n >= 0, where P-n (u) counts the number of distinct factors of length n in the infinite word u and where the boundary of Q is constructed of 2p horizontal and 2q vertical unit segments. (c) 2006 Published by Elsevier Ltd.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available