Polyomino tilings, cellular automata and codicity
Theoretical Computer Science
Two-dimensional finite state recognizability
Fundamenta Informaticae - Special issue on formal language theory
Theoretical Computer Science
A codicity undecidable problem in the plane
Theoretical Computer Science - Special issue: Tilings of the plane
Adding symbolic information to picture models: definitions and properties
Theoretical Computer Science
Theoretical Computer Science
Plane-filling properties of directed figures
FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management
| Hi-index | 0.00 |
We consider directed figures defined as labelled polyominoes with designated start and end points, equipped with catenation operation that uses a merging function to resolve possible conflicts. This is one of possible extensions generalizing words and variable-length codes to planar structures, creating a new tool for e.g. image analysis and retrieval. Within this model, we define four kinds of codes that differ in their treatment of start and end points. This is a generalization that weakens (one or both of) equality tests in the classical definition of a code. We show a strict hierarchy of those kinds and prove that testing whether a given set of figures is a code of a given kind is decidable. This is an extension of previous results, leading to a verification algorithm for codes of all four kinds.