arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1611.09017cs.DMcs.FLmath.CO
收藏

前缀正规词与前缀范式

On Prefix Normal Words and Prefix Normal Forms

Péter Burcsi, Gabriele Fici, Zsuzsanna Lipták, Frank Ruskey, Joe Sawada

摘要:

$1$ -前缀正规字是具有如下性质的二进制字:没有因子具有比相同长度的前缀更多的$1$;类似地定义$0$ -前缀正规字。这些词出现在索引二进制混杂模式匹配的上下文中,其中目的是决定词是否具有给定数量的$1$和$0$(给定Parikh向量)的因子。每个二进制字具有字的因子的帕里克向量的关联集合。使用前缀正常的话,我们提供了一个表征的等价类的二进制字具有相同的一组Parikh向量的因素。我们证明了前缀正规词的语言不是上下文无关的,并且严格包含在前项链的语言中,这是林登词的幂的前缀。我们给出的计数结果$\textit{pnw}(n)$,长度$n$的前缀正常字的数量,表明,对于足够大的$n$,\[ 2^{n-4 \sqrt{n \lg n}} \le \textit{pnw}(n) \le 2^{n - \lg n + 1}. \]对于固定的密度(数$1$),我们表明,普通的生成函数的前缀正常字的长度$n$和密度$d$是一个合理的功能。最后,我们给出了$\textit{pnw}(n)$的实验结果,讨论了进一步的性质,并提出了一些有待解决的问题。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑