Characterisations of balanced words via orderings

Authors:
Oliver Jenkinson;Luca Q. Zamboni
Affiliations:
School of Mathematical Science, Queen Mary, University of London, Mile End Road, London, E1 4NS, UK and Department of Mathematics, University of North Texas, Denton, TX;School of Mathematical Science, Queen Mary, University of London, Mile End Road, London, E1 4NS, UK and Department of Mathematics, University of North Texas, Denton, TX
Venue:
Theoretical Computer Science
Year:
2004

Citing 1
Cited 10

Some combinatorial properties of Sturmian words

Theoretical Computer Science

Some characterizations of finite Sturmian words

Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
Characterizations of finite and infinite episturmian words via lexicographic orderings

European Journal of Combinatorics
On θ-episturmian words

European Journal of Combinatorics
Compressed string-matching in standard Sturmian words

Theoretical Computer Science
Circular sturmian words and Hopcroft's algorithm

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

CAI'07 Proceedings of the 2nd international conference on Algebraic informatics
Balancing and clustering of words in the Burrows-Wheeler transform

Theoretical Computer Science
A note on Sturmian words

Theoretical Computer Science
Some Characterizations of Sturmian Words in Terms of the Lexicographic Order

Fundamenta Informaticae - Words, Graphs, Automata, and Languages; Special Issue Honoring the 60th Birthday of Professor Tero Harju
Abelian returns in Sturmian words

Journal of Combinatorial Theory Series A

Quantified Score

Hi-index	5.23

Visualization

Abstract

Three new characterisations of balanced words are presented. Each of these characterisations is based on the ordering of a shift orbit, either lexicographically or with respect to the norm |ċ|1 (which counts the number of occurrences of the symbol 1).