从字母排序中改进的字符串分解
Enhanced string factoring from alphabet orderings
摘要:
在本文中,我们考虑字符串分解的上下文中的字母顺序的概念。我们提出了一个贪婪型算法,该算法产生林登因子分解与大量的因素的修改,随着少量的因素。对于该技术,我们引入指数Parikh向量。最后讨论了循环UMFs的应用和研究方向。
英文摘要:
In this note we consider the concept of alphabet ordering in the context of string factoring. We propose a greedy-type algorithm which produces Lyndon factorizations with small numbers of factors along with a modification for large numbers of factors. For the technique we introduce the Exponent Parikh vector. Applications and research directions derived from circ-UMFFs are discussed.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。