前缀正规词的组合生成
On Combinatorial Generation of Prefix Normal Words
摘要:
前缀正常字是一个二进制字的属性,没有子串比相同长度的前缀多1。这类字在二进制混杂模式匹配的上下文中是重要的。本文提出了一种有效的算法,用于穷举具有固定长度的前缀正规字。该算法是基于这样一个事实,即前缀正常词的语言是一个气泡语言,一类二进制语言的属性,对于任何字w的语言,交换第一次出现的01由10在w的结果在另一个字的语言。我们证明了每个前缀正常的字是在O(n)摊销时间,并推测,根据实验证据,真正的摊销运行时间是O(polylog(n))。
英文摘要:
A prefix normal word is a binary word with the property that no substring has more 1s than the prefix of the same length. This class of words is important in the context of binary jumbled pattern matching. In this paper we present an efficient algorithm for exhaustively listing the prefix normal words with a fixed length. The algorithm is based on the fact that the language of prefix normal words is a bubble language, a class of binary languages with the property that, for any word w in the language, exchanging the first occurrence of 01 by 10 in w results in another word in the language. We prove that each prefix normal word is produced in O(n) amortized time, and conjecture, based on experimental evidence, that the true amortized running time is O(polylog(n)).
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。