Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
437593 | Theoretical Computer Science | 2011 | 9 Pages |
Abstract
In this paper we consider several types of equations on words, motivated by the attempt of characterizing the class of polyominoes that tile the plane by translation in two distinct ways. Words coding the boundary of these polyominoes satisfy an equation whose solutions are in bijection with a subset of the solutions of equations of the form . It turns out that the solutions are strongly related to local periodicity involving palindromes and conjugate words.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics