| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10334249 | Theoretical Computer Science | 2005 | 15 Pages |
Abstract
We study palindromic factors of billiard words, in any dimension. There are differences between the two-dimensional case, and higher dimension. Arbitrary long palindrome factors exist in any dimension, but arbitrary long palindromic prefixes exist in general only in dimension 2.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
J.-P. Borel, C. Reutenauer,