We present a new recursive generation algorithm for prefix normal words. These are binary words with the property that no factor has more 1s 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. Moreover, based on the original finite word, we can predict both the length and the density of an ultimate period of this infinite word.
|Titolo:||Bubble-Flip—A new generation algorithm for prefix normal words|
Liptak, Zsuzsanna (Corresponding)
|Data di pubblicazione:||2018|
|Appare nelle tipologie:||01.01 Articolo in Rivista|