| Issue |
RAIRO-Theor. Inf. Appl.
Volume 44, Number 4, October-December 2010
|
|
|---|---|---|
| Page(s) | 489 - 506 | |
| DOI | https://doi.org/10.1051/ita/2011005 | |
| Published online | 28 February 2011 | |
The code problem for directed figures
Institute of Computer Science, Jagiellonian University,
Łojasiewicza 6, 30-348 Kraków, Poland; mkol@smp.if.uj.edu.pl
Received:
18
March
2009
Accepted:
5
November
2010
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.
Mathematics Subject Classification: 68R15 / 68R99
Key words: Directed figures / variable-length codes / codicity verification / Sardinas-Patterson algorithm
© EDP Sciences, 2011
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.