Palindromic factors of billiard words

Authors:
J.-P. Borel;C. Reutenauer
Affiliations:
LACO, Limoges Cedex, France;UQÀM, Département de Mathématiques, Montreal, Québec, Canada
Venue:
Theoretical Computer Science - The art of theory
Year:
2005

Citing 7
Cited 6

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
A chararcterization of sturmian words by return words

European Journal of Combinatorics
Concrete Math

Concrete Math
Combinatories of Standard Sturmian Words

Structures in Logic and Computer Science, A Selection of Essays in Honor of Andrzej Ehrenfeucht

A geometrical characterization of factors of multidimensional Billiard words and some applications

Theoretical Computer Science
Two equivalence relations on digital lines with irrational slopes. A continued fraction approach to upper mechanical words

Theoretical Computer Science
Sturmian and episturmian words: a survey of some recent results

CAI'07 Proceedings of the 2nd international conference on Algebraic informatics
Central sturmian words: recent developments

DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
Palindromes in sturmian words

DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
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

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.