Fundamenta Informaticae - Special issue dedicated to A. Salomaa
Theoretical Computer Science
Many aspects of defect theorems
Theoretical Computer Science - Words, languages and combinatorics
Hi-index | 0.00 |
Defect theorem, a classical result of combinatorics on words, can be extended on 2- dimensional words and trees under some restrictions. In this note we answer to two open problems stated in W. Moczurad, (Theor. Inform. Appl. 41, 2007): whether the defect property holds or does not hold for three rectangles and for two figures of unrestricted shape. We give two counterexamples to show that the defect property fails in both situations. This completes the analysis of the defect property with 2- dimensional words in the classes of dominoes, squares, rectangles and figures with unrestricted shape. In addition, we examine the same question of the validity of the defect property with trees.