An incremental algorithm for constructing minimal deterministic finite cover automata

被引：0
|
作者：
Campeanu, C
Paun, A
Smith, JR
机构：
[1] Louisiana Tech Univ, Dept Comp Sci, Inst Micromfg, Coll Engn & Sci, Ruston, LA 71272 USA
[2] Univ Prince Edward Isl, Dept Comp Sci & Informat Technol, Charlottetown, PE C1A 4P3, Canada
来源：
IMPLEMENTATION AND APPLICATION OF AUTOMATA | 2006年 / 3845卷
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We present a fast incremental algorithm for constructing minimal DFCA for a given language. Since it was shown that the DFCA for a language L can have less states than the DFA for L, this technique seen-is to be the best choice for incrementally building the automaton for a large language, especially when the number of states in the DFCA is significantly less than the number of states in the corresponding minimal DFA. We have implemented the proposed algorithm and have tested it against the best known DFCA minimization technique.
引用
收藏
页码：90 / 103
页数：14
相关论文
共 50 条
  • [1] Incremental construction of minimal deterministic finite cover automata
    Campeanu, Cezar
    Paun, Andrei
    Smith, Jason R.
    THEORETICAL COMPUTER SCIENCE, 2006, 363 (02) : 135 - 148
  • [2] A fast and simple algorithm for constructing minimal acyclic deterministic finite automata
    Watson, BW
    JOURNAL OF UNIVERSAL COMPUTER SCIENCE, 2002, 8 (02): : 363 - 367
  • [3] An O(n2) algorithm for constructing minimal cover automata for finite languages
    Paun, A
    Sântean, N
    Yu, S
    IMPLEMENTATION AND APPLICATION OF AUTOMATA, 2001, 2088 : 243 - 251
  • [4] The number of similarity relations and the number of minimal deterministic finite cover automata
    Câmpeanu, C
    Paun, A
    IMPLEMENTATION AND APPLICATION OF AUTOMATA, 2003, 2608 : 67 - 76
  • [5] Minimal Reversible Deterministic Finite Automata
    Holzer, Markus
    Jakobi, Sebastian
    Kutrib, Martin
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2018, 29 (02) : 251 - 270
  • [6] Minimal Reversible Deterministic Finite Automata
    Holzer, Markus
    Jakobi, Sebastian
    Kutrib, Martin
    DEVELOPMENTS IN LANGUAGE THEORY (DLT 2015), 2015, 9168 : 276 - 287
  • [7] Non-Deterministic Finite Cover Automata
    Campeanu, Cezar
    SCIENTIFIC ANNALS OF COMPUTER SCIENCE, 2015, 25 (01) : 3 - 28
  • [8] More on deterministic and nondeterministic finite cover automata
    Gruber, Hermann
    Holzer, Markus
    Jakobi, Sebastian
    THEORETICAL COMPUTER SCIENCE, 2017, 679 : 18 - 30
  • [9] Minimal cover-automata for finite languages
    Câmpeanu, C
    Sântean, N
    Yu, S
    THEORETICAL COMPUTER SCIENCE, 2001, 267 (1-2) : 3 - 16
  • [10] Exact generation of minimal acyclic deterministic finite automata
    Almeida, Marco
    Moreira, Nelma
    Reis, Rogerio
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2008, 19 (04) : 751 - 765
12345