Some Characterizations of Sturmian Words in Terms of the Lexicographic Order
نویسندگان
چکیده
In this paper we present three new characterizations of Sturmian words based on the lexicographic ordering of their factors.
منابع مشابه
Sturmian and Episturmian Words (A Survey of Some Recent Results)
This survey paper contains a description of some recent results concerning Sturmian and episturmian words, with particular emphasis on central words. We list fourteen characterizations of central words. We give the characterizations of Sturmian and episturmian words by lexicographic ordering, we show how the Burrows-Wheeler transform behaves on Sturmian words. We mention results on balanced epi...
متن کاملCharacterizations of finite and infinite episturmian words via lexicographic orderings
In this paper, we characterize by lexicographic order all finite Sturmian and episturmian words, i.e., all (finite) factors of such infinite words. Consequently, we obtain a characterization of infinite episturmian words in a wide sense (episturmian and episkew infinite words). That is, we characterize the set of all infinite words whose factors are (finite) episturmian. Similarly, we character...
متن کاملOccurrence and Lexicographic Properties of Standard Sturmian Words
Standard Sturmian words form an interesting class of structurally highly compressible strings. represented by simple recurrences. We show that simplicity of representation implies new algorithmic results: the compressed string matching for such words can be solved by very special algorithms and the output is simply characterized. Each standard Sturmian word w has Occurrence Shift Property: the ...
متن کاملSome characterizations of finite Sturmian words
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.
متن کاملInequalities characterizing standard Sturmian and episturmian words
Considering the smallest and the greatest factorswith respect to the lexicographic orderwe 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 ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Fundam. Inform.
دوره 116 شماره
صفحات -
تاریخ انتشار 2012