Discovery of Approximate Lexicographical Order Dependencies

Author(s):  
Yifeng Jin ◽  
Zijing Tan ◽  
Jixuan Chen ◽  
Shuai Ma
2004 ◽  
Vol 14 (01) ◽  
pp. 83-97
Author(s):  
JONG-CHUANG TSAY

A parenthesis string is a string of left and right parentheses. The string is well-formed when it consists of balanced pairs of left and right parentheses. This study presents a novel systolic algorithm for generating all the well-formed parenthesis strings in lexicographical order. The algorithm is cost-optimal and is run on a linear array of processors such that each well-formed parenthesis string can be generated in three time steps. The processor array is appropriate for VLSI implementation, since it has the features of modularity, regularity, and local connection.


Author(s):  
Christophe Reutenauer

This chapter covers the lexicographical ordering of lower Christoffel words, which is equivalent to the ordering by their slopes (Borel and Laubie). Lower Christoffel words are particular Lyndon words. They are maximum for the lexicographical order among Lyndon words of a given slope (Borel and Laubie). They are, together with the upper Christoffel words, the only unbordered finite Sturmian words (Chuan). They are exactly the Lyndon words which are Sturmian words (Berstel and de Luca). The standard factorization of a lower Christoffel word is obtained by cutting before the smallest lexicographical suffix. Finally, they are exactly the Lyndon words which are equilibrated (Melançon).


Sign in / Sign up

Export Citation Format

Share Document