Wyniki wyszukiwania - BazTech

Ograniczanie wyników

1 Schedae Informaticae

1 2013

Znaleziono wyników: 1

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: domino graph

Sortuj według:

Ogranicz wyniki do:

Testing decipherability of directed figure codes with domino graphs

Moczurad M., Moczurad W.

Schedae Informaticae

2013

Vol. 22

27--40

Various kinds of decipherability of codes, weaker than unique decipherability, have been studied since mid-1980s. We consider 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 con icts. This setting extends decipherability questions from words to 2D structures. In the present paper we develop a (variant of) domino graph that will allow us to decide some of the decipherability kinds by searching the graph for specific paths. Thus the main result characterizes directed figure decipherability by graph properties.