ON TRACE INCLUSION OPTIMIZATION PROBLEMS

被引：0
|
作者：
Shahbazyan, K. V. [1 ]
Shoukourian, Yu. H. [1 ]
机构：
[1] Natl Acad Sci Republ Armenia, Inst Informat & Automat Problems, Yerevan, Armenia
来源：
CYBERNETICS AND SYSTEMS ANALYSIS | 2010年 / 46卷 / 06期
关键词：
trace theory; string processing; optimization; inclusion problem;
D O I：
10.1007/s10559-010-9268-0
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
The following four optimization problems over a finite set of traces are considered: (i) find the longest trace that is included in each trace from a given finite set T of traces, (ii) find the shortest trace that is not included in every trace from a given finite set T of traces, (iii) find the shortest trace that includes every trace from a given finite set T of traces, (iv) find the longest trace that does not include each trace from a given finite set T of traces.
引用
收藏
页码：869 / 878
页数：10
相关论文
共 50 条
12345