Abstract
A one-dimensional tiling is a bi-infinite string on a finite alphabet, and its tiling semigroup is an inverse semigroup whose elements are marked finite substrings of the tiling. We characterize the structure of these semigroups in the periodic case, in which the tiling is obtained by repetition of a fixed primitive word. © 2009 Copyright Australian Mathematical Publishing Association, Inc.
Original language | English |
---|---|
Pages (from-to) | 153-160 |
Number of pages | 8 |
Journal | Journal of the Australian Mathematical Society |
Volume | 87 |
Issue number | 2 |
DOIs | |
Publication status | Published - Oct 2009 |
Keywords
- Inverse semigroup
- Partition
- Tiling