The Average Complexity of Moore's State Minimization Algorithm Is O(n log log n)

被引：0
|
作者：
David, Julien [1 ]
机构：
[1] Univ Paris Est, Inst Gaspard Monge, F-77454 Marne La Vallee 2, France
来源：
MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2010 | 2010年 / 6281卷
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We prove that the average complexity, for the uniform distribution on complete deterministic automata, of Moore's state minimization algorithm is O(n log log n), where n is the number of states in the input automata
引用
收藏
页码：318 / 329
页数：12
相关论文
共 50 条
  • [1] An O(n√n, log log n) average case algorithm for the maximum induced matching problem in permutation graphs
    Viet Cuong Than
    Phan Thuan Do
    PROCEEDINGS OF THE 2018 5TH ASIAN CONFERENCE ON DEFENSE TECHNOLOGY (ACDT 2018), 2018, : 45 - 49
  • [2] A Deterministic Construction of Normal Bases With Complexity O(n3 + n log n log(log n) log q)
    Poli, A.
    Journal of Symbolic Computation, 19 (04):
  • [3] AN O(N LOG N LOG LOG N) PARALLEL MAXIMUM MATCHING ALGORITHM FOR BIPARTITE GRAPHS
    KIM, T
    CHWA, KY
    INFORMATION PROCESSING LETTERS, 1987, 24 (01) : 15 - 17
  • [4] Distributed MIS in O (log log n) Awake Complexity
    Dufoulon, Fabien
    Moses, William K., Jr.
    Pandurangan, Gopal
    PROCEEDINGS OF THE 2023 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING, PODC 2023, 2023, : 135 - 145
  • [5] A DETERMINISTIC CONSTRUCTION OF NORMAL BASES WITH COMPLEXITY O(N(3)+N LOG-N LOG(LOG-N) LOG-Q)
    POLI, A
    JOURNAL OF SYMBOLIC COMPUTATION, 1995, 19 (04) : 305 - 319
  • [6] An O(log n log log n) space algorithm for undirected st-connectivity
    Trifonov, Vladimir
    SIAM JOURNAL ON COMPUTING, 2008, 38 (02) : 449 - 483
  • [7] An O(log n/log log n)-Approximation Algorithm for the Asymmetric Traveling Salesman Problem
    Asadpour, Arash
    Goemans, Michel X.
    Madry, Aleksander
    Gharan, Shayan Oveis
    Saberi, Amin
    OPERATIONS RESEARCH, 2017, 65 (04) : 1043 - 1061
  • [8] An O(log n/log log n)-approximation Algorithm for the Asymmetric Traveling Salesman Problem
    Asadpour, Arash
    Goemans, Michel X.
    Madry, Aleksander
    Gharan, Shayan Oveis
    Saberi, Amin
    PROCEEDINGS OF THE TWENTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2010, 135 : 379 - +
  • [9] An O(n(3) log log n/log(2) n) time algorithm for all pairs shortest paths
    Han, Yijie
    Takaoka, Tadao
    JOURNAL OF DISCRETE ALGORITHMS, 2016, 38-41 : 9 - 19
  • [10] OPTIMAL PARALLEL SELECTION HAS COMPLEXITY O (LOG LOG N)
    AJTAI, M
    KOMLOS, J
    STEIGER, WL
    SZEMEREDI, E
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1989, 38 (01) : 125 - 133
12345