Failure Deterministic Finite Automata

被引:0
|
作者
Kourie, Derrick G. [1 ]
Watson, Bruce W. [2 ]
Cleophas, Loek [1 ,3 ]
Venter, Fritz [1 ]
机构
[1] Univ Pretoria, ZA-0002 Pretoria, South Africa
[2] Univ Stellenbosch, ZA-7600 Stellenbosch, South Africa
[3] Eindhoven Univ Technol, NL-5600 MB Eindhoven, Netherlands
来源
PROCEEDINGS OF THE PRAGUE STRINGOLOGY CONFERENCE 2012 | 2012年
关键词
failure arcs; DFA; formal concept analysis; LATTICES;
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Inspired by failure functions found in classical pattern matching algorithms, a failure deterministic finite automaton (FDFA) is defined as a formalism to recognise a regular language. An algorithm, based on formal concept analysis, is proposed for deriving from a given deterministic finite automaton (DFA) a language-equivalent FDFA. The FDFA's transition diagram has fewer arcs than that of the DFA. A small modification to the classical DFA's algorithm for recognising language elements yields a corresponding algorithm for an FDFA.
引用
收藏
页码:28 / 41
页数:14
相关论文
共 50 条
  • [1] Deterministic adaptive finite automata
    De Castro Jr., A.A.
    Neto, J.J.
    Pistori, H.
    IEEE Latin America Transactions, 2007, 5 (07) : 515 - 521
  • [2] On Bidirectional Deterministic Finite Automata
    Dieck, Simon
    Verwer, Sicco
    IMPLEMENTATION AND APPLICATION OF AUTOMATA, CIAA 2024, 2024, 15015 : 109 - 123
  • [3] LEARNING FALLIBLE DETERMINISTIC FINITE AUTOMATA
    RON, D
    RUBINFELD, R
    MACHINE LEARNING, 1995, 18 (2-3) : 149 - 185
  • [4] Minimal Reversible Deterministic Finite Automata
    Holzer, Markus
    Jakobi, Sebastian
    Kutrib, Martin
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2018, 29 (02) : 251 - 270
  • [5] The Degree of Irreversibility in Deterministic Finite Automata
    Axelsen, Holger Bock
    Holzer, Markus
    Kutrib, Martin
    Implementation and Application of Automata, 2016, 9705 : 15 - 26
  • [6] On Parallel Implementations of Deterministic Finite Automata
    Holub, Jan
    Stekr, Stanislav
    IMPLEMENTATION AND APPLICATION OF AUTOMATA, PROCEEDINGS, 2009, 5642 : 54 - 64
  • [7] Preimage problems for deterministic finite automata
    Berlinkov, Mikhail, V
    Ferens, Robert
    Szykula, Marek
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2021, 115 : 214 - 234
  • [8] Compacted Implementations of Deterministic Finite Automata
    Zhang, Meng
    Zhang, Yi
    Lv, Wei
    Hou, Chen
    JOURNAL OF COMPUTATIONAL AND THEORETICAL NANOSCIENCE, 2014, 11 (03) : 893 - 898
  • [9] Amount of nonconstructivity in deterministic finite automata
    Freivalds, Rusins
    THEORETICAL COMPUTER SCIENCE, 2010, 411 (38-39) : 3436 - 3443
  • [10] The Degree of Irreversibility in Deterministic Finite Automata
    Axelsen, Holger Bock
    Holzer, Markus
    Kutrib, Martin
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2017, 28 (05) : 503 - 522