| Issue |
RAIRO-Theor. Inf. Appl.
Volume 48, Number 2, April-June 2014
|
|
|---|---|---|
| Page(s) | 173 - 186 | |
| DOI | https://doi.org/10.1051/ita/2013045 | |
| Published online | 21 January 2014 | |
Incremental DFA minimisation∗
Faculdade de Ciências, Universidade do
Porto ;
mfa@dcc.fc.up.pt,nam@dcc.fc.up.pt,rvr@dcc.fc.up.pt
Received:
11
August
2012
Accepted:
11
December
2013
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.
Mathematics Subject Classification: 68Q45 / 68Q65 / 68Q25
Key words: Regular languages / finite automata / minimisation algorithms
© EDP Sciences 2014
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.