Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
9657805 | Theoretical Computer Science | 2005 | 17 Pages |
Abstract
Considering the smallest and the greatest factors with respect to the lexicographic order we associate to each infinite word r two other infinite words min(r) and max(r). In this paper we prove that the inequalities as⩽min(s)⩽max(s)⩽bs characterize standard Sturmian words (proper ones and periodic ones) and that the condition “for any xâA and lexicographic order < satisfying x=min(A) one has xs⩽min(s)” characterizes standard episturmian words.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Giuseppe Pirillo,