On the number of factors of Sturmian words
Theoretical Computer Science
Some combinatorial properties of Sturmian words
Theoretical Computer Science
Sturmian words, Lyndon words and trees
Theoretical Computer Science
Theoretical Computer Science
Sturmian words: structure, combinatorics, and their arithmetics
Theoretical Computer Science - Special issue: formal language theory
Theory of Codes
Combinatories of Standard Sturmian Words
Structures in Logic and Computer Science, A Selection of Essays in Honor of Andrzej Ehrenfeucht
Burrows--Wheeler transform and Sturmian words
Information Processing Letters
Harmonic and gold Sturmian words
European Journal of Combinatorics
Codes of central Sturmian words
Theoretical Computer Science - The art of theory
Palindromic factors of billiard words
Theoretical Computer Science - The art of theory
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
A characterization of bispecial sturmian words
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Enumeration and structure of trapezoidal words
Theoretical Computer Science
On the structure of bispecial Sturmian words
Journal of Computer and System Sciences
| Hi-index | 0.00 |
A word w is central if it has two periods p and q which are coprime and such that |w|= p+q–2. Central words play an essential role in the combinatorics of Sturmian words. The aim of this paper is to give an overview on central words focusing some recent developments in the study of their structure, combinatorics, and arithmetics. Moreover, some results are concerned with remarkable languages of central words such as central codes and Farey's codes. Another interesting class of central languages is given by the so-called Farey languages which give faithful representations of Farey's series.