ReFaM: a software tool for minimizing nondeterministic finite automata

被引：0
作者：
Tsyganov, Andrey V. [1 ]
机构：
[1] Ulyanovsk State Pedag Univ, Ulyanovsk, Russia
来源：
14TH INTERNATIONAL SYMPOSIUM ON SYMBOLIC AND NUMERIC ALGORITHMS FOR SCIENTIFIC COMPUTING (SYNASC 2012) | 2012年
关键词：
D O I：
10.1109/SYNASC.2012.49
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
In the present paper we introduce a new software tool which can be used for minimizing finite automata. The distinguishing feature of this tool is that it's primarily aimed at nondeterministic finite automata minimization. It provides several exact and heuristic minimization methods and uses parallel techniques such as OpenMP and MPI to speed up the most time consuming parts of the implemented algorithms. The description of implemented methods and available commands as well as some experimental results are provided.
引用
收藏
页码：187 / 191
页数：5
相关论文
共 17 条
  • [1] Almeida M., 2007, R PERFORMANCE AUTOMA
  • [2] Glover F., 2003, HDB METAHEURISTICS
  • [3] Hopcroft J., 1979, Introduction to automata theory, languages, and computation
  • [4] Hromkovic J., 2001, TEXT THEORET COMP S
  • [5] MINIMAL NFA PROBLEMS ARE HARD
    JIANG, T
    RAVIKUMAR, B
    [J]. SIAM JOURNAL ON COMPUTING, 1993, 22 (06) : 1117 - 1141
  • [6] ON STATE MINIMIZATION OF NONDETERMINISTIC FINITE AUTOMATA
    KAMEDA, T
    WEINER, P
    [J]. IEEE TRANSACTIONS ON COMPUTERS, 1970, C 19 (07) : 617 - &
  • [7] KELL V, 1989, LECT NOTES COMPUT SC, V349, P537
  • [8] Lombardy S, 2003, LECT NOTES COMPUT SC, V2759, P96
  • [9] Melnikov B., 2002, KOREAN J COMPUTATION, V9, P131
  • [10] Melnikov B. F., 2009, NONDETERMINISTIC FIN
12