The code problem for directed figures

@article{Kolarz2010TheCP,
  title={The code problem for directed figures},
  author={Michal Kolarz},
  journal={RAIRO Theor. Informatics Appl.},
  year={2010},
  volume={44},
  pages={489-506}
}
  • M. Kolarz
  • Published 1 October 2010
  • Computer Science, Mathematics
  • RAIRO Theor. Informatics Appl.
We consider directed figures defined as labelled polyominoes with designated start and end points, with two types of catenation operations. We are especially interested in codicity verification for sets of figures, and we show that depending on the catenation type the question whether a given set of directed figures is a code is decidable or not. In the former case we give a constructive proof which leads to a straightforward algorithm. 

Domino Graphs and the Decipherability of Directed Figure Codes

TLDR
A (variant of) domino graph is developed that will allow us to decide some of the decipherability kinds of directed figure codes by searching the graph for specific paths, and characterizes directed figure decipherability by graph properties.

Decidability of multiset, set and numerically decipherable directed figure codes

TLDR
This work considers decipherability of directed figure codes, where directed figures are defined as labelled polyominoes with designated start and end points, equipped with catenation operation that may use a merging function to resolve possible conflicts.

A pr 2 01 6 Decidability of multiset , set and numerically decipherable directed figure codes

TLDR
This work considers decipherability of directed figure codes, where directed figures are defined as labelled polyominoes with designated start and end points, equipped with catenation operation that may use a merging function to resolve possible conflicts.

Testing decipherability of directed figure codes with domino graphs

TLDR
A (variant of) domino graph is developed that will allow us to decide some of the decipherability kinds by searching the graph for specific paths, and characterizes directed figure decipherability by graph properties.

Multiset, Set and Numerically Decipherable Codes over Directed Figures

TLDR
This work considers decipherability of directed figure codes, where directed figures are defined as labelled polyominoes with designated start and end points, equipped with catenation operation that may use a merging function to resolve possible conflicts.

Plane-Filling Properties of Directed Figures

TLDR
This paper proposes a model based on directed figures with partial catenation, demonstrating a unifying approach that could be useful for the study of self-assembly and proves several undecidability results related to filling the plane with a given set of figures and formation of infinite and semiinfinite zippers.

Combinatorial Algorithms

  • S. Smyth
  • Mathematics
    Lecture Notes in Computer Science
  • 2012
TLDR
The relationships between the girth and the quasi-completeness of a graph are established and an upper bound is derived for the largest order γ-quasi-complete subgraph in a graph of minimum degree r is derived.

Directed Figure Codes with Weak Equality

TLDR
This work considers 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, creating a new tool for e.g. image analysis and retrieval.

References

SHOWING 1-10 OF 10 REFERENCES

Directed figure codes are decidable

TLDR
It is proved that in this setting verification whether a given finite set of directed Figures is a code is decidable and a constructive algorithm is given and the status of the defect effect for directed figures is clarified.

Decidability of Simple Brick Codes

Bricks are polyominoes with labelled cells. The problem whether a given set of bricks is a code,is undecidable in general. It is open for two-element sets. Here we consider sets consisting of square

Some Open Problems in Decidability of Brick (Labelled Polyomino) Codes

TLDR
The codicity problem is decidable for sets with keys of size n when n = 1 and, under obvious constraints, for every n, and it is proved that it is undecidable in the general case of sets with Key n, when n≥ 6.

Defect theorem in the plane

TLDR
This work establishes the defect property in the case of three dominoes ( n × 1 or 1 × n rectangles) in the context of labelled polyominoes, i.e. two-dimensional figures.

Codes and equations on trees

Theory of codes

A codicity undecidable problem in the plane

Polyomino tilings

  • cellular automata and codicity. Theoret. Comput. Sci. 147
  • 1995