Some remarks on tiling recognizable languages
From MaRDI portal
Recommendations
- On the tiling system recognizability of various classes of convex polyominoes
- Tiling Recognizable Two-Dimensional Languages
- A brief excursion inside the class of tiling recognizable two-dimensional languages
- Recognizable picture languages and domino tiling
- A stronger recognizability condition for two-dimensional languages
Cited in
(15)- Lattices of local two-dimensional languages
- Recognizable picture languages and domino tiling
- Strip tiling and regular grammars
- A tiling system for the class of L-convex polyominoes
- On languages of one-dimensional overlapping tiles
- Polyoisominoes
- Online tessellation automaton recognizing various classes of convex polyominoes
- Regular geometrical languages and tiling the plane
- Recognizable Picture Languages and Polyominoes
- Highly Undecidable Problems about Recognizability by Tiling Systems
- scientific article; zbMATH DE number 4005638 (Why is no real title available?)
- Estimating the Size of Context-Free Tiling Languages
- scientific article; zbMATH DE number 2040907 (Why is no real title available?)
- On the tiling system recognizability of various classes of convex polyominoes
- An undecidable problem about rational sets and contour words of polyominoes
This page was built for publication: Some remarks on tiling recognizable languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5475633)
