Geodesic
Computing ε-free NFA from regular expressions in O(nlog 2 (n)) time
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 34 (2000) no. 4, pp. 257-277

Voir la notice de l'article provenant de la source Numdam

@article{ITA_2000__34_4_257_0,
     author = {Hagenah, Christian and Muscholl, Anca},
     title = {Computing $\varepsilon $-free {NFA} from regular expressions in $O(n \log ^2 (n))$ time},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {257--277},
     publisher = {EDP-Sciences},
     volume = {34},
     number = {4},
     year = {2000},
     mrnumber = {1809860},
     zbl = {0971.68091},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/ITA_2000__34_4_257_0/}
}
TY  - JOUR
AU  - Hagenah, Christian
AU  - Muscholl, Anca
TI  - Computing $\varepsilon $-free NFA from regular expressions in $O(n \log ^2 (n))$ time
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 2000
SP  - 257
EP  - 277
VL  - 34
IS  - 4
PB  - EDP-Sciences
UR  - http://geodesic.mathdoc.fr/item/ITA_2000__34_4_257_0/
LA  - en
ID  - ITA_2000__34_4_257_0
ER  - 
%0 Journal Article
%A Hagenah, Christian
%A Muscholl, Anca
%T Computing $\varepsilon $-free NFA from regular expressions in $O(n \log ^2 (n))$ time
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 2000
%P 257-277
%V 34
%N 4
%I EDP-Sciences
%U http://geodesic.mathdoc.fr/item/ITA_2000__34_4_257_0/
%G en
%F ITA_2000__34_4_257_0
Hagenah, Christian; Muscholl, Anca. Computing $\varepsilon $-free NFA from regular expressions in $O(n \log ^2 (n))$ time. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 34 (2000) no. 4, pp. 257-277. http://geodesic.mathdoc.fr/item/ITA_2000__34_4_257_0/