273 search results - page 4 / 55 » On periodicity of two-dimensional words |
160
click to vote
LATA
2009
Springer
16 years 24 days ago
2009
Springer
We propose an algorithm that given as input a full word w of length n, and positive integers p and d, outputs (if any exists) a maximal p-periodic partial word contained in w with ...
137
click to vote
IPL
2006
15 years 6 months ago
2006
Counting the number of distinct factors in the words of a language gives a measure of complexity for that language similar to the factor-complexity of infinite words. Similarly as ...
125
click to vote
DLT
2008
15 years 7 months ago
2008
By the famous theorem of Morse and Hedlund, a word is ultimately periodic if and only if it has bounded subword complexity, i.e., for sufficiently large n, the number of factors of...