The parameterized complexity of intersection and composition operations on sets of finite-state automata

被引：0
|
作者：
Wareham, HT [1 ]
机构：
[1] Mem Univ Newfoundland, Dept Comp Sci, St Johns, NF A1B 3X5, Canada
来源：
IMPLEMENTATION AND APPLICATION OF AUTOMATA | 2001年 / 2088卷
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
This paper uses parameterized complexity analysis to delimit possible non-polynomial time algorithmic behaviors for the finite-state acceptor intersection and finite-state transducer intersection and composition problems. One important result derived as part of these analyses is the first proof of the NP-hardness of the finite-state transducer composition problem for both general and p-subsequential transducers.
引用
收藏
页码：302 / 310
页数：9
相关论文
共 50 条
12345