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 条

[11] A new Lenstra-type algorithm for quasiconvex polynomial integer minimization with complexity 2O(n log n)
Hildebrand, Robert
Koeppe, Matthias
DISCRETE OPTIMIZATION, 2013, 10 (01) : 69 - 84
[12] A T-decomposition algorithm with O(n log n) time and space complexity
Yang, J
Speidel, U
2005 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), VOLS 1 AND 2, 2005, : 23 - 27
[13] Tree Evaluation Is in Space O(log n• log log n)
Cook, James
Mertz, Ian
PROCEEDINGS OF THE 56TH ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING, STOC 2024, 2024, : 1268 - 1278
[14] AN O(N LOG N + M LOG LOG N) MAXIMUM WEIGHT CLIQUE ALGORITHM FOR CIRCULAR-ARC GRAPHS
SHIH, WK
HSU, WL
INFORMATION PROCESSING LETTERS, 1989, 31 (03) : 129 - 134
[15] An O(N log N) algorithm for shape modeling
Malladi, R.
Sethian, J. A.
Proceedings of the National Academy of Sciences of the United States of America, 93 (18):
[16] AN O(N LOG N) MANHATTAN PATH ALGORITHM
LIPSKI, W
INFORMATION PROCESSING LETTERS, 1984, 19 (02) : 99 - 102
[17] An O(N log N) algorithm for shape modeling
Malladi, R
Sethian, JA
PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 1996, 93 (18) : 9389 - 9392
[18] Bisimilarity Minimization in O(m log n) Time
Valmari, Antti
APPLICATIONS AND THEORY OF PETRI NETS, PROCEEDINGS, 2009, 5606 : 123 - 142
[19] An O(n log n) algorithm for the zoo-keeper's problem
Bespamyatnikh, S
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2003, 24 (02): : 63 - 74
[20] An O(n3(log log n/log n)5/4) time algorithm for all pairs shortest paths
Han, Yijie
ALGORITHMS - ESA 2006, PROCEEDINGS, 2006, 4168 : 411 - 417

← 1 2 3 4 5 →