Pages that link to "Item:Q1884974"

The following pages link to Characterisations of balanced words via orderings (Q1884974):

Displaying 27 items.

• Abelian powers and repetitions in Sturmian words (Q287434) (← links)
• A note on Sturmian words (Q418801) (← links)
• Standard Sturmian words and automata minimization algorithms (Q496057) (← links)
• Cyclic complexity of words (Q507796) (← links)
• Balancing and clustering of words in the Burrows-Wheeler transform (Q544888) (← links)
• On factorially balanced sets of words (Q719290) (← links)
• Circular Sturmian words and Hopcroft's algorithm (Q732029) (← links)
• On \(\theta\)-episturmian words (Q1003600) (← links)
• Balance properties of multi-dimensional words (Q1605336) (← links)
• Compressed string-matching in standard Sturmian words (Q2271418) (← links)
• On the number of partitions of an integer in the \(m\)-bonacci base (Q2372776) (← links)
• Characterizations of finite and infinite episturmian words via lexicographic orderings (Q2462316) (← links)
• Some characterizations of finite Sturmian words. (Q2490813) (← links)
• Cyclic Complexity of Words (Q2922011) (← links)
• Balances of m-bonacci Words (Q2934872) (← links)
• The most unbalanced words 0^q-p1^p and majorization (Q3451066) (← links)
• Sturmian and Episturmian Words (Q3522857) (← links)
• Balanced Words Having Simple Burrows-Wheeler Transform (Q3637245) (← links)
• BALANCED WORDS AND MAJORIZATION (Q5189987) (← links)
• On a group theoretic generalization of the Morse-Hedlund theorem (Q5270140) (← links)
• Abelian Repetitions in Sturmian Words (Q5300843) (← links)
• Episturmian words: a survey (Q5321774) (← links)
• The Burrows-Wheeler Transform between Data Compression and Combinatorics on Words (Q5326383) (← links)
• On the Number of Balanced Words of Given Length and Height over a Two-Letter Alphabet (Q5396736) (← links)
• (Q5465070) (← links)
• Clustering and Arnoux-Rauzy words (Q6184901) (← links)
• Some results on digital segments and balanced words (Q6639744) (← links)