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 条
  • [21] Conditions for Minimal Fuzzy Deterministic Finite Automata via Brzozowski's Procedure
    Gonzalez de Mendivil, Jose R.
    IEEE TRANSACTIONS ON FUZZY SYSTEMS, 2018, 26 (04) : 2409 - 2420
  • [22] Query Learning of Minimal Deterministic Symbolic Finite Automata Separating Regular Languages
    Kawasaki, Yoshito
    Hendrian, Diptarama
    Yoshinaka, Ryo
    Shinohara, Ayumi
    SOFSEM 2024: THEORY AND PRACTICE OF COMPUTER SCIENCE, 2024, 14519 : 340 - 354
  • [23] Failure Deterministic Finite Automata
    Kourie, Derrick G.
    Watson, Bruce W.
    Cleophas, Loek
    Venter, Fritz
    PROCEEDINGS OF THE PRAGUE STRINGOLOGY CONFERENCE 2012, 2012, : 28 - 41
  • [24] Deterministic adaptive finite automata
    De Castro Jr., A.A.
    Neto, J.J.
    Pistori, H.
    IEEE Latin America Transactions, 2007, 5 (07) : 515 - 521
  • [25] On Bidirectional Deterministic Finite Automata
    Dieck, Simon
    Verwer, Sicco
    IMPLEMENTATION AND APPLICATION OF AUTOMATA, CIAA 2024, 2024, 15015 : 109 - 123
  • [26] Learning Deterministic Finite Automata with a smart state labeling evolutionary algorithm
    Lucas, SM
    Reynolds, TJ
    IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2005, 27 (07) : 1063 - 1074
  • [27] Incremental Construction of Minimal Tree Automata
    Carrasco, Rafael C.
    Daciuk, Jan
    Forcada, Mikel L.
    ALGORITHMICA, 2009, 55 (01) : 95 - 110
  • [28] Incremental Construction of Minimal Tree Automata
    Rafael C. Carrasco
    Jan Daciuk
    Mikel L. Forcada
    Algorithmica, 2009, 55 : 95 - 110
  • [29] Generating Minimal Nondeterministic Finite Automata Using a Parallel Algorithm
    Jastrzab, Tomasz
    Czech, Zbigniew J.
    Wieczorek, Wojciech
    2020 19TH INTERNATIONAL SYMPOSIUM ON PARALLEL AND DISTRIBUTED COMPUTING (ISPDC 2020), 2020, : 37 - 43
  • [30] Deterministic blow-ups of minimal nondeterministic finite automata over a fixed alphabet
    Jirasek, Jozef
    Jiraskova, Calina
    Szabari, Alexander
    DEVELOPMENTS IN LANGUAGE THEORY, PROCEEDINGS, 2007, 4588 : 254 - +
12345