On an expansion of nondeterministic finite automata

被引：2
|
作者：
Melnikov B. [1 ,2 ,3 ]
机构：
[1] Ulyanovsk (Simbirsk) Branch, Moscow University, Ulyanovsk State University
[2] Department of Mathematics and Computer Science, Togliatti State University, Togliatti, Samarskaya obi., 445667, Belorusskaya str.
来源：
Journal of Applied Mathematics and Computing | 2007年 / 24卷 / 1-2期
关键词：
Algorithms of simplification; Basis automaton; Extended automata; Nondeterministic finite automata;
D O I：
10.1007/BF02832307
中图分类号：
学科分类号：
摘要：
We consider a possible generalization of nondeterministic finite automata. The goals of this consideration are: to apply some obtained algorithms for various problems of minimization of classical nondeterministic automata; to use such automata for describing practical anytime algorithms for the same problems of minimization; to simplify some proofs for algorithms of simplification for usual nondeterministic automata. © 2007 Korean Society for Computational & Applied Mathematics and Korean SIGCAM.
引用
收藏
页码：155 / 165
页数：10
相关论文
共 50 条
  • [1] Reversible Nondeterministic Finite Automata
    Holzer, Markus
    Kutrib, Martin
    [J]. REVERSIBLE COMPUTATION, RC 2017, 2017, 10301 : 35 - 51
  • [2] Extended Nondeterministic Finite Automata
    Melnikov, Boris
    [J]. FUNDAMENTA INFORMATICAE, 2010, 104 (03) : 255 - 265
  • [3] ON STATE MINIMIZATION OF NONDETERMINISTIC FINITE AUTOMATA
    KAMEDA, T
    WEINER, P
    [J]. IEEE TRANSACTIONS ON COMPUTERS, 1970, C 19 (07) : 617 - &
  • [4] Finite nondeterministic automata: Simulation and minimality
    Calude, CS
    Calude, E
    Khoussainov, B
    [J]. THEORETICAL COMPUTER SCIENCE, 2000, 242 (1-2) : 219 - 235
  • [5] Descriptional complexity of nondeterministic finite automata
    Salomaa, Kai
    [J]. Developments in Language Theory, Proceedings, 2007, 4588 : 31 - 35
  • [6] On path equivalence of nondeterministic finite automata
    Tzeng, WG
    [J]. INFORMATION PROCESSING LETTERS, 1996, 58 (01) : 43 - 46
  • [7] Simplifying Nondeterministic Finite Cover Automata
    Campeanu, Cezar
    [J]. ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2014, (151): : 162 - 173
  • [8] On Parallel Induction of Nondeterministic Finite Automata
    Jastrzab, Tomasz
    [J]. INTERNATIONAL CONFERENCE ON COMPUTATIONAL SCIENCE 2016 (ICCS 2016), 2016, 80 : 257 - 268
  • [9] 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
  • [10] Lengths of words accepted by nondeterministic finite automata
    Potechin, Aaron
    Shallit, Jeffrey
    [J]. INFORMATION PROCESSING LETTERS, 2020, 162
12345