Complexity of cutting words on regular tilings
From MaRDI portal
(Redirected from Publication:854843)
Recommendations
- Words, tilings and combinatorial spectra
- Complexity and cohomology for cut-and-projection tilings
- scientific article; zbMATH DE number 3892611
- Words, automata and Lie theory for tilings
- scientific article; zbMATH DE number 1820116
- Decidability and periodicity of low complexity tilings
- scientific article; zbMATH DE number 7650899
- scientific article; zbMATH DE number 4085051
- The complexity of tangent words
- Maximal pattern complexity of two-dimensional words
Cites work
- scientific article; zbMATH DE number 780179 (Why is no real title available?)
- scientific article; zbMATH DE number 5051583 (Why is no real title available?)
- A remark on morphic sturmian words
- Asymptotic behavior in a heap model with two pieces
- Combinatorial properties of sequences defined by the billiard in the tesselation triangles
- Complexity and growth for polygonal billiards
- Complexity of sequences defined by billiard in the cube
- Complexity of trajectories in rectangular billiards
- On translating one polyomino to tile the plane
- Substitution invariant cutting sequences
Cited in
(4)
This page was built for publication: Complexity of cutting words on regular tilings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q854843)