One-dimensional tiling semigroups.
A language \(L\) over a finite alphabet \(\Sigma\) is called factorial if any proper non-empty factor of any word from \(L\) belongs to \(L\). Inverse semigroups \(S(L)\) determined by factorial languages are investigated. Properties of \(S(L)\) and constructions of \(S(L)\) are proved. These semigroups have two important consequences. A tile is a connected closed bounded subset of \(\mathbb{R}^n\) such that it is equal to the closure of its interior. A sequence of tiles covering \(\mathbb{R}^n\) is called tiling if the intersection of two distinct tiles from this sequence is a subset of its boundaries. A tool for the study of tilings are semigroups determined by them. A tiling semigroup of a one-dimensional tiling \(\mathcal T\) is isomorphic to \(S(L)\) for the language \(L\) determined by \(\mathcal T\). The second application of inverse semigroups \(S(L)\) concerns semigroups describing shift spaces (a shift space is a set of bi-infinite words with forbidden factors).
- Some fundamental properties of tiling semigroups
- Universal groups for point-sets and tilings.
- Tiling semigroups
- Tilings, Lie theory and combinatorics.
- Tiling Semigroups ofn-Dimensional Hypercubic Tilings
- One-Dimensional Tiling Semigroups and Factorial Languages
- THE TILING SEMIGROUPS OF ONE-DIMENSIONAL PERIODIC TILINGS
- Strongly \(F^*\)-inverse covers for tiling semigroups.
This page was built for publication: One-dimensional tiling semigroups.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1434111)
