Edge-minimization of non-deterministic finite automata

被引：0
|
作者：
Melnikov B.F. [1 ]
Melnikova A.A. [2 ]
机构：
[1] Department of Mechanics and Mathematics, Simbirsk State University, Simbirsk (Ulyanovsk), 432700, L.Tolstoy str.
[2] Department of Economics, Dimitrovgrad Branch of Simbirsk State University, Dimitrovgrad, 433510, Dimitrov str.
来源：
Korean Journal of Computational and Applied Mathematics | 2001年 / 8卷 / 3期
关键词：
Edge-minimization; Finite automata; Regular languages;
D O I：
10.1007/BF02941980
中图分类号：
学科分类号：
摘要：
In this paper we consider non-deterministic finite Rabin-Scott's automata. We use a special structure to describe all the possible edges of non-deterministic finite automation defining the given regular language. Such structure can be used for solving various problems of finite automata theory. One of these problems is edge-minimization of non-deterministic automata. As we have not touched this problem before, we obtain here two versions of the algorithm for solving this problem to continue previous series of articles.
引用
收藏
页码：469 / 479
页数：10
相关论文
共 50 条
  • [1] Edge-minimization of non-deterministic finite automata
    Melnikov, B.F.
    Melnikova, A.A.
    [J]. Journal of Applied Mathematics and Computing, 2001, 8 (03) : 469 - 479
  • [2] Minimization of non-deterministic automata with large alphabets
    Abdulla, PA
    Deneux, J
    Kaati, L
    Nilsson, M
    [J]. IMPLEMENTATION AND APPLICATION OF AUTOMATA, 2006, 3845 : 31 - 42
  • [3] Non-Deterministic Finite Cover Automata
    Campeanu, Cezar
    [J]. SCIENTIFIC ANNALS OF COMPUTER SCIENCE, 2015, 25 (01) : 3 - 28
  • [4] Once More on the Edge-Minimization of Nondeterministic Finite Automata and the Connected Problems
    Melnikov, Boris
    [J]. FUNDAMENTA INFORMATICAE, 2010, 104 (03) : 267 - 283
  • [5] On the power of non-deterministic quantum finite automata
    Nakanishi, M
    Indoh, T
    Hamaguchi, K
    Kashiwabara, T
    [J]. IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2002, E85D (02) : 327 - 332
  • [6] Minimizing a Class of Non-Deterministic Finite Automata
    Zhang, Li
    [J]. ASIA-PACIFIC YOUTH CONFERENCE ON COMMUNICATION TECHNOLOGY 2010 (APYCCT 2010), 2010, : 471 - 474
  • [7] EQUIVALENCE PROBLEM OF NON-DETERMINISTIC FINITE AUTOMATA
    NOZAKI, A
    [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1979, 18 (01) : 8 - 17
  • [8] FINITE-MEMORY AUTOMATA WITH NON-DETERMINISTIC REASSIGNMENT
    Kaminski, Michael
    Zeitlin, Daniel
    [J]. INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2010, 21 (05) : 741 - 760
  • [9] Width of Non-Deterministic Automata
    Kuperberg, Denis
    Majumdar, Anirban
    [J]. 35TH SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2018), 2018, 96
  • [10] Fuzzy and non-deterministic automata
    J. Močkoř
    [J]. Soft Computing, 1999, 3 (4) : 221 - 226
12345