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
关键词
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 条