Ranking and unranking bordered and unbordered words

IF 0.7 4区计算机科学 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS

Information Processing Letters Pub Date : 2023-10-12 DOI:10.1016/j.ipl.2023.106452

Daniel Gabric

引用次数: 0

Abstract

A border of a word w is a word that is both a non-empty proper prefix and suffix of w. If w has a border, then it is said to be bordered; otherwise, it is said to be unbordered. The main results of this paper are the first algorithms to rank and unrank length-n bordered and unbordered words over a k-letter alphabet. We show that, under the unit-cost RAM model, ranking bordered and unbordered words can be done in $O (k n^{3})$ time using $O (n)$ space, and unranking them can be done in $O (n^{4} k \log k)$ time using $O (n)$ space.

查看原文本刊更多论文

排序和取消排序有边框和无边框的单词

单词w的边界是一个既是w的非空专有前缀又是w的后缀的单词。如果w有边界，则称其为有边界的；否则，它被认为是无边界的。本文的主要结果是第一个在k字母表上对长度为n的有界和无界单词进行排序和取消排序的算法。我们证明，在单位成本RAM模型下，使用O（n）空间可以在O（kn3）时间内对有界和无界字进行排序，并且可以在O⁡k）使用O（n）空间的时间。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Information Processing Letters 工程技术-计算机：信息系统

CiteScore

1.80

自引率

0.00%

发文量

审稿时长

7.3 months

期刊介绍： Information Processing Letters invites submission of original research articles that focus on fundamental aspects of information processing and computing. This naturally includes work in the broadly understood field of theoretical computer science; although papers in all areas of scientific inquiry will be given consideration, provided that they describe research contributions credibly motivated by applications to computing and involve rigorous methodology. High quality experimental papers that address topics of sufficiently broad interest may also be considered. Since its inception in 1971, Information Processing Letters has served as a forum for timely dissemination of short, concise and focused research contributions. Continuing with this tradition, and to expedite the reviewing process, manuscripts are generally limited in length to nine pages when they appear in print.