On Infinite Prefix Normal Words

被引：2
|
作者：
Cicalese, Ferdinando [1 ]
Liptak, Zsuzsanna [1 ]
Rossi, Massimiliano [1 ]
机构：
[1] Univ Verona, Dipartimento Informat, Str Grazie 15, I-37134 Verona, Italy
来源：
THEORY AND PRACTICE OF COMPUTER SCIENCE, SOFSEM 2019 | 2019年 / 11376卷
关键词：
Combinatorics on words; Prefix normal words; Infinite words; Sturmian words; Abelian complexity; Paperfolding word; Thue-Morse sequence; Lexicographic order; ABELIAN COMPLEXITY;
D O I：
10.1007/978-3-030-10801-4_11
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
Prefix normal words are binary words that have no factor with more 1s than the prefix of the same length. Finite prefix normal words were introduced in [Fici and Lipt ' ak, DLT 2011]. In this paper, we study infinite prefix normal words and explore their relationship to some known classes of infinite binary words. In particular, we establish a connection between prefix normal words and Sturmian words, between prefix normal words and abelian complexity, and between prefix normality and lexicographic order.
引用
收藏
页码：122 / 135
页数：14
相关论文
共 50 条
  • [1] On infinite prefix normal words
    Cicalese, Ferdinando
    Liptak, Zsuzsanna
    Rossi, Massimiliano
    [J]. THEORETICAL COMPUTER SCIENCE, 2021, 859 : 134 - 148
  • [2] On prefix normal words and prefix normal forms
    Burcsi, Peter
    Fici, Gabriele
    Liptak, Zsuzsanna
    Ruskey, Frank
    Sawada, Joe
    [J]. THEORETICAL COMPUTER SCIENCE, 2017, 659 : 1 - 13
  • [3] The asymptotic number of prefix normal words
    Balister, Paul
    Gerke, Stefanie
    [J]. THEORETICAL COMPUTER SCIENCE, 2019, 784 : 75 - 80
  • [4] On Combinatorial Generation of Prefix Normal Words
    Burcsi, Peter
    Fici, Gabriele
    Liptak, Zsuzsanna
    Ruskey, Frank
    Sawada, Joe
    [J]. COMBINATORIAL PATTERN MATCHING, CPM 2014, 2014, 8486 : 60 - 69
  • [5] Weighted Prefix Normal Words: Mind the Gap
    Eikmeier, Yannik
    Fleischmann, Pamela
    Kulczynski, Mitja
    Nowotka, Dirk
    [J]. DEVELOPMENTS IN LANGUAGE THEORY, DLT 2021, 2021, 12811 : 143 - 154
  • [6] Leaf realization problem, caterpillar graphs and prefix normal words
    Masse, Alexandre Blondin
    de Carufel, Julien
    Goupil, Alain
    Lapointe, Melodie
    Nadeau, Emile
    Vandomme, Elise
    [J]. THEORETICAL COMPUTER SCIENCE, 2018, 732 : 1 - 13
  • [7] Bubble-Flip-A New Generation Algorithm for Prefix Normal Words
    Cicalese, Ferdinando
    Liptak, Zsuzsanna
    Rossi, Massimiliano
    [J]. LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS (LATA 2018), 2018, 10792 : 207 - 219
  • [8] Bubble-Flip-A new generation algorithm for prefix normal words
    Cicalese, Ferdinando
    Liptak, Zsuzsanna
    Rossi, Massimiliano
    [J]. THEORETICAL COMPUTER SCIENCE, 2018, 743 : 38 - 52
  • [9] A note on prefix primitive words
    Chen-Ming Fan
    C. C. Huang
    [J]. Acta Informatica, 2010, 47 : 413 - 423
  • [10] A note on prefix primitive words
    Fan, Chen-Ming
    Huang, C. C.
    [J]. ACTA INFORMATICA, 2010, 47 (7-8) : 413 - 423
12345