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 条
  • [31] Comparison of construction algorithms for minimal, acyclic, deterministic, finite-state automata from sets of strings
    Daciuk, J
    IMPLEMENTATION AND APPLICATION OF AUTOMATA, 2003, 2608 : 255 - 261
  • [32] STATE-SIZE HIERARCHY FOR FINITE-STATE COMPLEXITY
    Calude, Cristian S.
    Salomaa, Kai
    Roblot, Tania K.
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2012, 23 (01) : 37 - 50
  • [33] An Evolution Strategy for the Induction of Fuzzy Finite-State Automata
    万敏
    莫智文
    Journal of Electronic Science and Technology of China, 2005, (03) : 284 - 287
  • [34] An approximate determinization algorithm for weighted finite-state automata
    Buchsbaum, AL
    Giancarlo, R
    Westbrook, JR
    ALGORITHMICA, 2001, 30 (04) : 503 - 526
  • [35] FSA utilities: A toolbox to manipulate finite-state automata
    van Noord, G
    AUTOMATA IMPLEMENTATION, 1997, 1260 : 87 - 108
  • [36] Random Generation of Nondeterministic Finite-State Tree Automata
    Hanneforth, Thomas
    Maletti, Andreas
    Quernheim, Daniel
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2013, (134): : 11 - 16
  • [37] An evolution strategy for the induction of fuzzy finite-state automata
    Mo, ZW
    Wan, M
    Shu, L
    2005 IEEE International Conference on Granular Computing, Vols 1 and 2, 2005, : 579 - 582
  • [38] Incremental construction and maintenance of minimal finite-state automata
    Carrasco, RC
    Forcada, ML
    COMPUTATIONAL LINGUISTICS, 2002, 28 (02) : 207 - 216
  • [39] PRONUNCIATION MODELING Automatic Learning of Finite-state Automata
    Pastor, Moises
    Casacuberta, Francisco
    INTEGRATION OF PHONETIC KNOWLEDGE IN SPEECH TECHNOLOGY, 2005, 25 : 133 - 148
  • [40] An Approximate Determinization Algorithm for Weighted Finite-State Automata
    A. L. Buchsbaum
    R. Giancarlo
    J. R. Westbrook
    Algorithmica, 2001, 30 : 503 - 526
12345