Extended Nondeterministic Finite Automata

被引：4
|
作者：
Melnikov, Boris [1 ]
机构：
[1] Togliatti State Univ, Fac Math & Informat, Tolyatti 445667, Russia
来源：
FUNDAMENTA INFORMATICAE | 2010年 / 104卷 / 03期
关键词：
Nondeterministic finite automata; extended automata; basic automaton; algorithms of simplification;
D O I：
10.3233/FI-2010-348
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
We consider a new expansion of nondeterministic finite automata. The goals of this consideration are: to apply some algorithms of such expansion for various problems of minimization of classical nondeterministic automata; to use such automata for describing practical anytime algorithms for the same problems of minimization; using such automata, we often can simplify some proofs for algorithms of simplification of usual nondeterministic automata.
引用
收藏
页码：255 / 265
页数：11
相关论文
共 50 条
  • [1] Reversible Nondeterministic Finite Automata
    Holzer, Markus
    Kutrib, Martin
    [J]. REVERSIBLE COMPUTATION, RC 2017, 2017, 10301 : 35 - 51
  • [2] On an expansion of nondeterministic finite automata
    Melnikov B.
    [J]. Journal of Applied Mathematics and Computing, 2007, 24 (1-2) : 155 - 165
  • [3] Nondeterministic Right One-Way Jumping Finite Automata (Extended Abstract)
    Beier, Simon
    Holzer, Markus
    [J]. DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS, DCFS 2019, 2019, 11612 : 74 - 85
  • [4] CONCURRENT CONCISENESS OF DEGREE, PROBABILISTIC, NONDETERMINISTIC AND DETERMINISTIC FINITE AUTOMATA - EXTENDED ABSTRACT
    KINTALA, CMR
    WOTSCHKE, D
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1986, 210 : 291 - 305
  • [5] ON STATE MINIMIZATION OF NONDETERMINISTIC FINITE AUTOMATA
    KAMEDA, T
    WEINER, P
    [J]. IEEE TRANSACTIONS ON COMPUTERS, 1970, C 19 (07) : 617 - &
  • [6] Descriptional complexity of nondeterministic finite automata
    Salomaa, Kai
    [J]. Developments in Language Theory, Proceedings, 2007, 4588 : 31 - 35
  • [7] Finite nondeterministic automata: Simulation and minimality
    Calude, CS
    Calude, E
    Khoussainov, B
    [J]. THEORETICAL COMPUTER SCIENCE, 2000, 242 (1-2) : 219 - 235
  • [8] On path equivalence of nondeterministic finite automata
    Tzeng, WG
    [J]. INFORMATION PROCESSING LETTERS, 1996, 58 (01) : 43 - 46
  • [9] On Parallel Induction of Nondeterministic Finite Automata
    Jastrzab, Tomasz
    [J]. INTERNATIONAL CONFERENCE ON COMPUTATIONAL SCIENCE 2016 (ICCS 2016), 2016, 80 : 257 - 268
  • [10] Parallel Induction of Nondeterministic Finite Automata
    Jastrzab, Tomasz
    Czech, Zbigniew J.
    Wieczorek, Wojciech
    [J]. PARALLEL PROCESSING AND APPLIED MATHEMATICS, PPAM 2015, PT I, 2016, 9573 : 248 - 257
12345