Name
Abstract | ||
|---|---|---|
The Critical Factorization Theorem is one of the principal results in combinatorics on words. It relates local periodicities of a word to its global periodicity. In this paper we give a multidimensional extension of it. More precisely, we give a new proof of the Critical Factorization Theorem, but in a weak form, where the weakness is due to the fact that we loose the tightness of the local repetition order. In exchange, we gain the possibility of extending our proof to the multidimensional case. Indeed, this new proof makes use of the Theorem of Fine and Wilf, that has several classical generalizations to the multidimensional case. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1016/j.tcs.2005.08.012 | Theor. Comput. Sci. |
Keywords | DocType | Volume |
Combinatorics on words,local periodicity,global periodicity,new proof,multidimensional critical factorization theorem,classical generalization,principal result,multidimensional extension,Multidimensional words,multidimensional case,weak form,Critical Factorization Theorem,Periodicity,local repetition order | Journal | 346 |
Issue | ISSN | Citations |
2 | Theoretical Computer Science | 1 |
PageRank | References | Authors |
0.37 | 16 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Chiara Epifanio | 1 | 36 | 4.33 |
| Filippo Mignosi | 2 | 569 | 99.71 |