No CrossRef data available.
Article contents
The code problem for directed figures
Published online by Cambridge University Press: 28 February 2011
Abstract
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.
- Type
- Research Article
- Information
- RAIRO - Theoretical Informatics and Applications , Volume 44 , Issue 4 , October 2010 , pp. 489 - 506
- Copyright
- © EDP Sciences, 2011
References
Aigrain, P. and Beauquier, D., Polyomino tilings, cellular automata and codicity.
Theoret. Comput. Sci.
147 (1995) 165–180.
CrossRef
Beauquier, D. and Nivat, M., A codicity undecidable problem in the plane.
Theoret. Comput. Sci.
303 (2003) 417–430.
CrossRef
J. Berstel and D. Perrin, Theory of Codes. Academic Press (1985).
Costagliola, G., Ferrucci, F. and Gravino, C., Adding symbolic information to picture models: definitions and properties.
Theoret. Comput. Sci.
337 (2005) 51–104.
CrossRef
Kolarz, M. and Moczurad, W., Directed figure codes are decidable.
Discrete Mathematics and Theoretical Computer Science
11 (2009) 1–14.
Mantaci, S. and Restivo, A., Codes and equations on trees.
Theoret. Comput. Sci.
255 (2001) 483–509.
CrossRef
Moczurad, M. and
Moczurad, W., Decidability of simple brick codes, in Mathematics and Computer Science, Vol. III (Algorithms, Trees, Combinatorics and Probabilities). Trends in Mathematics, Birkhäuser (2004), 541–542.
Moczurad, M.
and Moczurad, W.,
Some open problems in decidability of brick (labelled polyomino) codes,
in Cocoon 2004 Proceedings.
Lect. Notes Comput. Sci.
3106 (2004) 72–81.
CrossRef
- 3
- Cited by