Article contents
Incremental DFA minimisation∗
Published online by Cambridge University Press: 21 January 2014
Abstract
We present a new incremental algorithm for minimising deterministic finite automata. It runs in quadratic time for any practical application and may be halted at any point, returning a partially minimised automaton. Hence, the algorithm may be applied to a given automaton at the same time as it is processing a string for acceptance. We also include some experimental comparative results.
- Type
- Research Article
- Information
- Copyright
- © EDP Sciences 2014
References
- 4
- Cited by