Voir la notice de l'article provenant de la source Numdam
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.
@article{ITA_2014__48_2_173_0,
author = {Almeida, Marco and Moreira, Nelma and Reis, Rog\'erio},
title = {Incremental {DFA} minimisation},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
pages = {173--186},
publisher = {EDP-Sciences},
volume = {48},
number = {2},
year = {2014},
doi = {10.1051/ita/2013045},
mrnumber = {3302483},
language = {en},
url = {http://geodesic.mathdoc.fr/articles/10.1051/ita/2013045/}
}
TY - JOUR AU - Almeida, Marco AU - Moreira, Nelma AU - Reis, Rogério TI - Incremental DFA minimisation JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications PY - 2014 SP - 173 EP - 186 VL - 48 IS - 2 PB - EDP-Sciences UR - http://geodesic.mathdoc.fr/articles/10.1051/ita/2013045/ DO - 10.1051/ita/2013045 LA - en ID - ITA_2014__48_2_173_0 ER -
%0 Journal Article %A Almeida, Marco %A Moreira, Nelma %A Reis, Rogério %T Incremental DFA minimisation %J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications %D 2014 %P 173-186 %V 48 %N 2 %I EDP-Sciences %U http://geodesic.mathdoc.fr/articles/10.1051/ita/2013045/ %R 10.1051/ita/2013045 %G en %F ITA_2014__48_2_173_0
Almeida, Marco; Moreira, Nelma; Reis, Rogério. Incremental DFA minimisation. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 48 (2014) no. 2, pp. 173-186. doi: 10.1051/ita/2013045
Cité par Sources :