ON CONSTRUCTING MINIMAL DETERMINISTIC FINITE AUTOMATON RECOGNIZING A PREFIX-CODE OF A GIVEN CARDINALITY

被引：0
|
作者：
Akishev, I. R. [1 ]
Dvorkin, M. E. [1 ]
机构：
[1] St Petersburg State Univ Informat Technol Mech &, St Petersburg, Russia
来源：
PRIKLADNAYA DISKRETNAYA MATEMATIKA | 2010年 / 8卷 / 02期
关键词：
D O I：
暂无
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
引用
收藏
页码：104 / 116
页数：13
相关论文
共 3 条
  • [1] An incremental algorithm for constructing minimal deterministic finite cover automata
    Campeanu, C
    Paun, A
    Smith, JR
    IMPLEMENTATION AND APPLICATION OF AUTOMATA, 2006, 3845 : 90 - 103
  • [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] Implementation of Equivalence of Deterministic Finite-State Automation and Non-deterministic Finite-State Automaton in Acceptance of Type 3 Languages Using Programming Code
    Rinku
    Sharma, Chetan
    Rangra, Ajay Kumar
    Kumar, Manish
    Madaan, Aman
    SOFTWARE ENGINEERING (CSI 2015), 2019, 731 : 17 - 25
1