Bubble-Flip-A New Generation Algorithm for Prefix Normal Words

被引:1
|
作者
Cicalese, Ferdinando [1 ]
Liptak, Zsuzsanna [1 ]
Rossi, Massimiliano [1 ]
机构
[1] Univ Verona, Dipartimento Informat, Str Grazie 15, I-37134 Verona, Italy
关键词
Algorithms on automata and words; Combinatorics on words; Combinatorial generation; Prefix normal words; Infinite words; Binary languages; BINARY STRINGS;
D O I
10.1007/978-3-319-77313-1_16
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
We present a new recursive generation algorithm for prefix normal words. These are binary words with the property that no factor has more is than the prefix of the same length. The new algorithm uses two operations on binary words, which exploit certain properties of prefix normal words in a smart way. We introduce infinite prefix normal words and show that one of the operations used by the algorithm, if applied repeatedly to extend the word, produces an ultimately periodic infinite word, which is prefix normal and whose period's length and density we can predict from the original word.
引用
收藏
页码:207 / 219
页数:13
相关论文
共 50 条
  • [1] Bubble-Flip-A new generation algorithm for prefix normal words
    Cicalese, Ferdinando
    Liptak, Zsuzsanna
    Rossi, Massimiliano
    [J]. THEORETICAL COMPUTER SCIENCE, 2018, 743 : 38 - 52
  • [2] 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
  • [3] 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
  • [4] On Infinite Prefix Normal Words
    Cicalese, Ferdinando
    Liptak, Zsuzsanna
    Rossi, Massimiliano
    [J]. THEORY AND PRACTICE OF COMPUTER SCIENCE, SOFSEM 2019, 2019, 11376 : 122 - 135
  • [5] On infinite prefix normal words
    Cicalese, Ferdinando
    Liptak, Zsuzsanna
    Rossi, Massimiliano
    [J]. THEORETICAL COMPUTER SCIENCE, 2021, 859 : 134 - 148
  • [6] The asymptotic number of prefix normal words
    Balister, Paul
    Gerke, Stefanie
    [J]. THEORETICAL COMPUTER SCIENCE, 2019, 784 : 75 - 80
  • [7] 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
  • [8] 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
  • [9] Scalar Prefix Search: A New Route Lookup Algorithm for Next Generation Internet
    Behdadfar, Mohammad
    Saidi, Hossein
    Alaei, Hamid
    Samari, Babak
    [J]. IEEE INFOCOM 2009 - IEEE CONFERENCE ON COMPUTER COMMUNICATIONS, VOLS 1-5, 2009, : 2509 - 2517
  • [10] Generation of isolated words by normal subjects
    Cardebat, D
    Candelon, N
    Kuznierek, L
    Viallard, G
    Démonet, JF
    Lambert, J
    [J]. ACTA NEUROLOGICA BELGICA, 2000, 100 (01) : 24 - 33