Results 1 -
3 of
3
Improvements to Watson's Incremental
"... We present three improvements to the incremental minimization algorithm presented by Bruce Watson at FSMNLP'2001 in Helsinki. Two of them do not affect the asymptotical worst-case computational complexity of the algorithm, but they can increase the speed on a large class of automata. The third im ..."
Abstract
- Add to MetaCart
We present three improvements to the incremental minimization algorithm presented by Bruce Watson at FSMNLP'2001 in Helsinki. Two of them do not affect the asymptotical worst-case computational complexity of the algorithm, but they can increase the speed on a large class of automata. The third improvement is introduction of full memoization (memoization in the original paper was only partial) , accompanied by the proof that the algorithm can run in O(jQj 2 ) time for all practical sizes of data -- much better than the exponential time given by Bruce Watson.
