Currently displaying 1 – 1 of 1

Showing per page

Order by Relevance | Title | Year of publication

Incremental DFA minimisation

Marco AlmeidaNelma MoreiraRogério Reis — 2014

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

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.

Page 1

Download Results (CSV)