Decision problems and regular chain code picture languages
Discrete Applied Mathematics
On the solvability of domino snake problems
Theoretical Computer Science
Reversibility and surjectivity problems of cellular automata
Journal of Computer and System Sciences
Monadic second-order logic over rectangular pictures and recognizability by tiling systems
Information and Computation
Recognizability of rectangular pictures by Wang systems
Journal of Automata, Languages and Combinatorics
Undecidability of existential properties in picture languages
Theoretical Computer Science
A new kind of science
On the Decidability of Self-Assembly of Infinite Ribbons
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
On Some Recognizable Picture-Languages
MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
Grammatical Picture Generation: A Tree-Based Approach (Texts in Theoretical Computer Science. An EATCS Series)
Infinite snake tiling problems
DLT'02 Proceedings of the 6th international conference on Developments in language theory
Picture Recognizability with Automata Based on Wang Tiles
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
| Hi-index | 5.23 |
We introduce a particular form of snake tilings to define picture languages, and relate the obtained family to the recognizable picture languages (as defined by Wang tiles). The correspondence for substitution tilings is even closer, and hence is applicable to the Hilbert curve.