Some results on digital segments and balanced words
From MaRDI portal
Publication:6639744
Recommendations
Cites work
- scientific article; zbMATH DE number 1577999 (Why is no real title available?)
- scientific article; zbMATH DE number 3885787 (Why is no real title available?)
- scientific article; zbMATH DE number 1024080 (Why is no real title available?)
- scientific article; zbMATH DE number 1737190 (Why is no real title available?)
- scientific article; zbMATH DE number 1408358 (Why is no real title available?)
- A combinatorial problem on trapezoidal words.
- Certain words on the real projective line
- Characterisations of balanced words via orderings
- Digital straightness -- a review
- Enumeration and structure of trapezoidal words
- Formal Languages, Automata and Numeration Systems 1
- Minimal non-convex words
- ON THE PALINDROMIC COMPLEXITY OF INFINITE WORDS
- On Christoffel classes
- On an involution of Christoffel words and Sturmian morphisms
- On some combinatorial problems in free monoids
- On the Number of Balanced Words of Given Length and Height over a Two-Letter Alphabet
- On the number of factors of Sturmian words
- On the structure of bispecial Sturmian words
- Some characterizations of finite Sturmian words.
- Some combinatorial properties of Sturmian words
- Studies on finite Sturmian words
- Sturmian and Episturmian Words
- Sturmian words, Lyndon words and trees
- Sturmian words: structure, combinatorics, and their arithmetics
- Symbolic Dynamics II. Sturmian Trajectories
- Symbolic dynamics.
This page was built for publication: Some results on digital segments and balanced words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6639744)
