A $1$-prefix normal word is a binary word with the property that no factor has more $1$s than the prefix of the same length; a $0$-prefix normal word is defined analogously. These words arise in the context of indexed binary jumbled pattern matching, where the aim is to decide whether a word has a factor with a given number of $1$s and $0$s (a given Parikh vector). Each binary word has an associated set of Parikh vectors of the factors of the word. Using prefix normal words, we provide a characterization of the equivalence class of binary words having the same set of Parikh vectors of their factors.
We prove that the language of prefix normal words is not context-free and is strictly contained in the language of pre-necklaces, which are prefixes of powers of Lyndon words. We give enumeration results on $\textit{pnw}(n)$, the number of prefix normal words of length $n$, showing that, for sufficiently large $n$, \[ 2^{n-4 \sqrt{n \lg n}} \le \textit{pnw}(n) \le 2^{n - \lg n + 1}. \]
For fixed density (number of $1$s), we show that the ordinary generating function of the number of prefix normal words of length $n$ and density $d$ is a rational function. Finally, we give experimental results on $\textit{pnw}(n)$, discuss further properties, and state open problems.
Characteristic Parameters and Special Trapezoidal Words
根据Aldo de Luca等人的早期工作,我们研究了梯形词及其前缀的特征参数$K$和$R$(最短不重复后缀的长度和最短无特殊因子的长度),以及它们的对称形式$H$和$L$。我们认为封闭(即,和非。我们的主要结果特征的权利特殊和严格双特殊梯形的话,所做的德卢卡和Mesquisi Sturmian的话。
在[A. Frid,S. Puzynina,L.Q. Zamboni,\textit{On palindromic factorization of words},Adv. in Appl.Math.50(2013),737-748]中,证实了因子的回文长度有界的任何无限字最终是周期性的。我们介绍这个猜想的变种,并证明这个猜想在特定情况下。特别地,我们引入左和右贪婪回文长度。这些长度总是大于或等于初始回文长度。当一个词的前缀的贪婪左(或右)回文长度有界时,这个词最终是周期性的。