How Many Figure Sets Are Codes?

Authors:
Małgorzata Moczurad;Włodzimierz Moczurad
Affiliations:
Institute of Computer Science, Jagiellonian University, Kraków, Poland 30-072;Institute of Computer Science, Jagiellonian University, Kraków, Poland 30-072
Venue:
Language and Automata Theory and Applications
Year:
2008

Citing 9
Cited 0

Generating functionology

Generating functionology
Defect theorems for trees

Fundamenta Informaticae - Special issue dedicated to A. Salomaa
Codes and equations on trees

Theoretical Computer Science
Multiple factorizations of words and defect effect

Theoretical Computer Science
Theory of Codes

Theory of Codes
A defect theorem for bi-infinite words

Theoretical Computer Science
A codicity undecidable problem in the plane

Theoretical Computer Science - Special issue: Tilings of the plane
Statistical properties of simple types

Mathematical Structures in Computer Science
Many aspects of defect theorems

Theoretical Computer Science - Words, languages and combinatorics

Quantified Score

Hi-index	0.00

Visualization

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.