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 条
  • [1] THE PARALLEL COMPLEXITY OF FINITE-STATE AUTOMATA PROBLEMS
    SANG, C
    HUYNH, DT
    [J]. INFORMATION AND COMPUTATION, 1992, 97 (01) : 1 - 22
  • [2] State complexity of unambiguous operations on finite automata
    Jiraskova, Galina
    Okhotin, Alexander
    [J]. THEORETICAL COMPUTER SCIENCE, 2019, 798 : 52 - 64
  • [3] Smaller representations for finite-state transducers and finite-state automata
    Roche, E
    [J]. COMBINATORIAL PATTERN MATCHING, 1995, 937 : 352 - 365
  • [4] State Complexity of Unambiguous Operations on Deterministic Finite Automata
    Jiraskova, Galina
    Okhotin, Alexander
    [J]. DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS, DCFS 2018, 2018, 10952 : 188 - 199
  • [5] State complexity of basic operations on nondeterministic finite automata
    Holzer, M
    Kutrib, M
    [J]. IMPLEMENTATION AND APPLICATION OF AUTOMATA, 2003, 2608 : 148 - 157
  • [6] Rough finite-state automata
    Basu, S
    [J]. CYBERNETICS AND SYSTEMS, 2005, 36 (02) : 107 - 124
  • [7] On the state complexity of operations on two-way finite automata
    Jiraskova, Galina
    Okhotin, Alexander
    [J]. INFORMATION AND COMPUTATION, 2017, 253 : 36 - 63
  • [8] Strongly convex attainable sets and low complexity finite-state controllers
    Weber, Alexander
    Reissig, Gunther
    [J]. 2013 3RD AUSTRALIAN CONTROL CONFERENCE (AUCC), 2013, : 61 - 66
  • [9] FINITE-STATE AUTOMATA IN INFORMATION TECHNOLOGIES
    Kryvyi, S. L.
    [J]. CYBERNETICS AND SYSTEMS ANALYSIS, 2011, 47 (05) : 669 - 683
  • [10] Deterministic chaotic finite-state automata
    Moatsum Alawida
    Azman Samsudin
    Je Sen Teh
    Wafa’ Hamdan Alshoura
    [J]. Nonlinear Dynamics, 2019, 98 : 2403 - 2421
12345