On multiset of factors of a word

被引：1
|
作者：
Kapoor, Kalpesh [1 ]
Nayak, Himadri [1 ]
机构：
[1] Indian Inst Technol Guwahati, Dept Math, Gauhati, India
来源：
INFORMATION PROCESSING LETTERS | 2013年 / 113卷 / 03期
关键词：
Combinatorial problems; Combinatorics on words; Repeated factors;
D O I：
10.1016/j.ipl.2012.09.010
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
Given two strings, we investigate the conditions under which they have common multiset of factors of a fixed length. We show that if two strings have the same multiset of factors of length less than or equal to k then they have a common prefix and suffix of length k - 1. We also show that if two strings have the same multiset of factors of length k and k 1 then they also have the same multiset of factors of length less than k - 1. (C) 2012 Elsevier B.V. All rights reserved.
引用
收藏
页码：78 / 80
页数：3
相关论文
共 50 条
12345