Some new results on palindromic factors of billiard words

Authors:
Jean-Pierre Borel;Christophe Reutenauer
Affiliations:
LACO, UMR CNRS 6090, Limoges Cedex, France;Département de Mathématiques, UQÀM, Montreal, Québec, Canada
Venue:
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
Year:
2005

Citing 7
Cited 1

Palindromes in the Fibonacci word

Information Processing Letters
Sturmian words, Lyndon words and trees

Theoretical Computer Science
Sturmian words: structure, combinatorics, and their arithmetics

Theoretical Computer Science - Special issue: formal language theory
Palindromes and Sturmian words

Theoretical Computer Science
Concrete Mathematics: A Foundation for Computer Science

Concrete Mathematics: A Foundation for Computer Science
Combinatories of Standard Sturmian Words

Structures in Logic and Computer Science, A Selection of Essays in Honor of Andrzej Ehrenfeucht
Automatic Sequences: Theory, Applications, Generalizations

Automatic Sequences: Theory, Applications, Generalizations

Complexity of degenerated three dimensional billiard words

DLT'06 Proceedings of the 10th international conference on Developments in Language Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

For heuristic reasons billiard words may have more palindromic factors than any other words. Many results are already known, concerning the palindromic factors and the palindromic prefixes of Sturmian words and billiard words on two letters. We give general results concerning multidimensional billiard words, which describe very different situations. In some cases, these words have arbitrary long palindromic prefix factors. In other cases, at the opposite, they have finitely many distinct palindromic factors. AMS classification: 68R15.