PL EN


Preferences help
enabled [disable] Abstract
Number of results
2013 | 22 |
Article title

Testing decipherability of directed figure codes with domino graphs

Content
Title variants
Languages of publication
PL
Abstracts
PL
Various kinds of decipherability of codes, weaker than unique de- cipherability, have been studied since mid-1980s. We consider decipherability of directed figure codes, where directed figures are defined as labelled polyomi- noes with designated start and end points, equipped with catenation operation that may use a merging function to resolve possible conflicts. This setting ex- tends 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.
Keywords
PL
 
Publisher
Year
Volume
22
Physical description
Dates
published
2013
online
21 - 05 - 2015
Contributors
References
Document Type
Publication order reference
Identifiers
YADDA identifier
bwmeta1.element.ojs-issn-2083-8476-year-2013-volume-22-article-2207
JavaScript is turned off in your web browser. Turn it on to take full advantage of this site, then refresh the page.