Abstract
Defect theorem, which provides a kind of dimension property for words, does not hold for two-dimensional figures (labelled polyominoes), except for some small sets. We thus turn to the analysis of asymptotic density of figure codes. Interestingly, it can often be proved to be 1, even in those cases where the defect theorem fails. Hence it reveals another weak dimension property which does hold for figures, i.e., non-codes are rare.
We show that the asymptotic densities of codes among the following sets are all equal to 1: (ordinary) words, square figures and small sets of dominoes, where small refers to cardinality ≤ 3. The latter is a borderline case for the defect theorem and additionally exhibits interesting properties at different alphabet sizes.
Keywords
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Beauquier, D., Nivat, M.: A codicity undecidable problem in the plane. Theoret. Comp. Sci. 303, 417–430 (2003)
Berstel, J., Perrin, D.: Theory of Codes. Academic Press, London (1985)
Harju, T., Karhumäki, J.: Many aspects of the defect effect. Theoret. Comp. Sci. 324, 35–54 (2004)
Karhumäki, J., Mantaci, S.: Defect Theorems for Trees. Fundam. Inform. 38, 119–133 (1999)
Karhumäki, J., Maňuch, J.: Multiple factorizations of words and defect effect. Theoret. Comp. Sci. 273, 81–97 (2002)
Karhumäki, J., Maňuch, J., Plandowski, W.: A defect theorem for bi-infinite words. Theoret. Comp. Sci. 292, 237–243 (2003)
Lothaire, M.: Combinatorics on Words. Cambridge University Press, Cambridge (1997)
Lothaire, M.: Algebraic Combinatorics on Words. Cambridge University Press, Cambridge (2002)
Mantaci, S., Restivo, A.: Codes and equations on trees. Theoret. Comp. Sci. 255, 483–509 (2001)
Maňuch, J.: Defect Effect of Bi-infinite Words in the Two-element Case. Discrete Mathematics & Theoretical Computer Science 4, 273–290 (2001)
Moczurad, M., Moczurad, W.: Asymptotic density of brick and word codes. Ars Combinatoria 83, 169–177 (2007)
Moczurad, M., Tyszkiewicz, J., Zaionc, M.: Statistical properties of simple types. Math. Struct. in Comp. Science 10, 575–594 (2000)
Moczurad, W.: Defect theorem in the plane. Theoret. Informatics Appl. 41, 403–409 (2007)
Wilf, H.: Generatingfunctionology. Academic Press, London (1994)
Yeats, K.: Asymptotic Density in Combined Number Systems. New York J. Math. 8, 63–83 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Moczurad, M., Moczurad, W. (2008). How Many Figure Sets Are Codes?. In: Martín-Vide, C., Otto, F., Fernau, H. (eds) Language and Automata Theory and Applications. LATA 2008. Lecture Notes in Computer Science, vol 5196. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88282-4_35
Download citation
DOI: https://doi.org/10.1007/978-3-540-88282-4_35
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-88281-7
Online ISBN: 978-3-540-88282-4
eBook Packages: Computer ScienceComputer Science (R0)