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 条

[21] An O(n3(log log n/log n)5/4) Time Algorithm for All Pairs Shortest Path
Yijie Han
Algorithmica, 2008, 51 : 428 - 434
[22] An O(n3(log log n/log n)5/4) time algorithm for all pairs shortest path
Han, Yijie
ALGORITHMICA, 2008, 51 (04) : 428 - 434
[23] An O(n3 log log n/log n) time algorithm for the all-pairs shortest path problem
Takaoka, T
INFORMATION PROCESSING LETTERS, 2005, 96 (05) : 155 - 161
[24] Randomized Mutual Exclusion in O(log N/log log N) RMRs
Hendler, Danny
Woelfel, Philipp
PODC'09: PROCEEDINGS OF THE 2009 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING, 2009, : 26 - 35
[25] AN O(N-LOG LOG-N)-TIME ALGORITHM FOR TRIANGULATING A SIMPLE POLYGON
TARJAN, RE
VANWYK, CJ
SIAM JOURNAL ON COMPUTING, 1988, 17 (01) : 143 - 178
[26] AN O(N(LOG LOG N)) LEARNING ALGORITHM FOR DNF UNDER THE UNIFORM-DISTRIBUTION
MANSOUR, Y
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1995, 50 (03) : 543 - 550
[27] AN O(LOG N) PARALLEL CONNECTIVITY ALGORITHM
SHILOACH, Y
VISHKIN, U
JOURNAL OF ALGORITHMS, 1982, 3 (01) : 57 - 67
[28] A O(n log2 n) Checker and O(n2 log n) Filtering Algorithm for the Energetic Reasoning
Ouellet, Yanick
Quimper, Claude-Guy
INTEGRATION OF CONSTRAINT PROGRAMMING, ARTIFICIAL INTELLIGENCE, AND OPERATIONS RESEARCH, CPAIOR 2018, 2018, 10848 : 477 - 494
[29] An O(n log n) Average Time Algorithm for Computing the Shortest Network under a Given Topology
G. Xue
D.-Z. Du
Algorithmica, 1999, 23 : 354 - 362
[30] An O(n log n) average time algorithm for computing the shortest network under a given topology
Xue, G
Du, DZ
ALGORITHMICA, 1999, 23 (04) : 354 - 362

← 1 2 3 4 5 →