A New Parameterization of Digital Straight Lines
IEEE Transactions on Pattern Analysis and Machine Intelligence
Some combinatorial properties of Sturmian words
Theoretical Computer Science
Random generation of finite Sturmian words
FPSAC '93 Proceedings of the 5th conference on Formal power series and algebraic combinatorics
Sturmian words, Lyndon words and trees
Theoretical Computer Science
On the combinatorics of finite words
Theoretical Computer Science
Vision Geometry
On Recursive, O(N) Partitioning of a Digitized Curve into Digital Straight Segments
IEEE Transactions on Pattern Analysis and Machine Intelligence
Characterisations of balanced words via orderings
Theoretical Computer Science
Moments of conjugacy classes of binary words
Theoretical Computer Science
Applied Combinatorics on Words (Encyclopedia of Mathematics and its Applications)
Applied Combinatorics on Words (Encyclopedia of Mathematics and its Applications)
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
Pseudopalindrome closure operators in free monoids
Theoretical Computer Science
Note: Rich, Sturmian, and trapezoidal words
Theoretical Computer Science
On a generalization of Christoffel words: epichristoffel 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
Theoretical Computer Science
Enumeration and structure of trapezoidal words
Theoretical Computer Science
Counting minimal semi-Sturmian words
Discrete Applied Mathematics
| Hi-index | 0.01 |
In this paper, we give some new characterizations of words which are finite factors of Sturmian words. An enumeration formula for primitive finite Sturmian words is given. Moreover, we provide two linear-time algorithms to recognize whether a finite word is Sturmian.