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 条

[31] A HYBRID OF QUICKSORT WITH O(N LOG N) WORST CASE COMPLEXITY
ROHRICH, J
INFORMATION PROCESSING LETTERS, 1982, 14 (03) : 119 - 123
[32] Towards a practical O(n log n) phylogeny algorithm
Truszkowski, Jakub
Hao, Yanqi
Brown, Daniel G.
ALGORITHMS FOR MOLECULAR BIOLOGY, 2012, 7
[33] An O(M(n) log n) Algorithm for the Jacobi Symbol
Brent, Richard P.
Zimmermann, Paul
ALGORITHMIC NUMBER THEORY, 2010, 6197 : 83 - +
[34] An O(n log n) algorithm for finding dissimilar strings
Abbasi, S
Sengupta, A
INFORMATION PROCESSING LETTERS, 1997, 62 (03) : 135 - 139
[35] AN O(N LOG N) SET REFINEMENT ALGORITHM WITH APPLICATIONS
RAO, NSV
SRIDHAR, R
IYENGAR, SS
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1991, 40 (3-4) : 129 - 138
[36] AN O(N LOG N) ALGORITHM FOR A MAXMIN LOCATION PROBLEM
RANGAN, CP
GOVINDAN, R
DISCRETE APPLIED MATHEMATICS, 1992, 36 (02) : 203 - 205
[37] An O(n log n) algorithm for the generalized birthday problem
Hwang, FK
Wright, PE
COMPUTATIONAL STATISTICS & DATA ANALYSIS, 1997, 23 (04) : 443 - 451
[38] An O (n(log n)2/log log n) algorithm for the single maximum coverage location or the (1, Xp)-medianoid problem on trees
Spoerhase, J.
Wirth, H. -C.
INFORMATION PROCESSING LETTERS, 2009, 109 (08) : 391 - 394
[39] Average Case Analysis of Moore's State Minimization Algorithm
Bassino, Frederique
David, Julien
Nicaud, Cyril
ALGORITHMICA, 2012, 63 (1-2) : 509 - 531
[40] Simple Bisimilarity Minimization in O(m log n) Time
Valmari, Antti
FUNDAMENTA INFORMATICAE, 2010, 105 (03) : 319 - 339

← 1 2 3 4 5 →