TRANSFINITE LYNDON WORDS

被引：0
|
作者：
Boasson, Luc [1 ]
Carton, Olivier [1 ]
机构：
[1] Univ Paris, IRIF, Paris, France
来源：
LOGICAL METHODS IN COMPUTER SCIENCE | 2020年 / 16卷 / 04期
关键词：
Lyndon words; ordinals;
D O I：
10.23638/LMCS-16(4:9)2020
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
In this paper, we extend the notion of Lyndon word to transfinite words. We prove two main results. We first show that, given a transfinite word, there exists a unique factorization in Lyndon words that are densely non-increasing, a relaxation of the condition used in the case of finite words. In the annex, we prove that the factorization of a rational word has a special form and that it can be computed from a rational expression describing the word.
引用
收藏
页数：38
相关论文
共 50 条
  • [21] Lyndon Words and Short Superstrings
    Mucha, Marcin
    [J]. PROCEEDINGS OF THE TWENTY-FOURTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA 2013), 2013, : 958 - 972
  • [22] LYNDON HEAPS - AN ANALOG OF LYNDON WORDS IN FREE PARTIALLY COMMUTATIVE MONOIDS
    LALONDE, P
    [J]. DISCRETE MATHEMATICS, 1995, 145 (1-3) : 171 - 189
  • [23] On Two-Dimensional Lyndon Words
    Marcus, Shoshana
    Sokol, Dina
    [J]. STRING PROCESSING AND INFORMATION RETRIEVAL (SPIRE 2013), 2013, 8214 : 206 - 217
  • [24] Periodic musical sequences and Lyndon words
    M. Chemillier
    [J]. Soft Computing, 2004, 8 : 611 - 616
  • [25] Lyndon words, polylogarithms and the Riemann ζ function
    Minh, HN
    Petitot, M
    [J]. DISCRETE MATHEMATICS, 2000, 217 (1-3) : 273 - 292
  • [26] Lyndon Partial Words and Arrays with Applications
    Paramasivan, Meenakshi
    Kumari, R. Krishna
    Arulprakasam, R.
    Dare, V. Rajkumar
    [J]. COMBINATORIAL IMAGE ANALYSIS, IWCIA 2022, 2023, 13348 : 226 - 244
  • [27] On morphisms preserving infinite Lyndon words
    Université de Picardie Jules Verne, LaRIA, 33 Rue Saint Leu, 80039 Amiens cedex 1, France
    [J]. Discrete Math. Theor. Comput. Sci., 2007, 2 (89-108):
  • [28] Gray code order for Lyndon words
    Vajnovszki, Vincent
    [J]. DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2007, 9 (02): : 145 - 151
  • [29] Monomial algebras defined by Lyndon words
    Gateva-Ivanova, Tatiana
    Floystad, Gunnar
    [J]. JOURNAL OF ALGEBRA, 2014, 403 : 470 - 496
  • [30] Generalized Lyndon factorizations of infinite words
    Burcroff, Amanda
    Winsor, Eric
    [J]. THEORETICAL COMPUTER SCIENCE, 2020, 809 : 30 - 38
12345