F. Coste and G. Kerbellec, A Similar Fragments Merging Approach to Learn Automata on Proteins, 16th European Conference on Machine Learning Machine Learning (ECML 2005), pp.522-529, 2005.
DOI : 10.1007/11564096_50
URL : https://hal.archives-ouvertes.fr/inria-00070340

M. Giraud and D. Lavenier, Linear Encoding Scheme for Weighted Finite Automata, 9th International Conference on Implementation and Application of Automata (CIAA 2004), pp.146-155, 2004.
DOI : 10.1007/978-3-540-30500-2_14

M. Giraud and D. Lavenier, Dealing with hardware space limits when removing epsilon-transitions in a genomic weighted finite automaton, Journal of Automata, Languages and Combinatorics, vol.10, pp.265-285, 2005.

C. Hagenah and A. Muscholl, Computing ?-free NFA from regular expressions in O ` n log 2 (n) ´ time, Mathematical Foundations of Computer Science LNCS, vol.1450, pp.277-285, 1998.

J. Hromkovic, S. Seibert, and T. Wilke, Translating regular expressions into small epsilon-free nondeterministic finite automata, 14th Symposium on Theoretical Aspects of Computer Science (STACS 1997), pp.55-66, 1997.

J. Hromkovic and G. Schnitger, NFAs With and Without ??-Transitions, 32nd International Colloquium on Automata, Languages and Programming (ICALP 2005), pp.385-396, 2005.
DOI : 10.1007/11523468_32

Y. Lifshits, A lower bound on the size of ??-free NFA corresponding to a regular expression, Information Processing Letters, vol.85, issue.6, pp.293-299, 2003.
DOI : 10.1016/S0020-0190(02)00436-2

M. Mohri, GENERIC ???-REMOVAL AND INPUT ???-NORMALIZATION ALGORITHMS FOR WEIGHTED TRANSDUCERS, International Journal of Foundations of Computer Science, vol.13, issue.01, pp.129-143, 2002.
DOI : 10.1142/S0129054102000996

M. Mohri, Finite-State Transducers in Language and Speech Processing, Computational Linguistics, vol.23, pp.269-311, 1997.

P. Quignon, M. Giraud, M. Rimbault, P. Lavigne, S. Tacher et al., The dog and rat olfactory receptor repertoires, Genome Biology, vol.6, issue.10, p.83, 2005.
DOI : 10.1186/gb-2005-6-10-r83
URL : https://hal.archives-ouvertes.fr/hal-00107100

G. Schnitger, Regular Expressions and NFAs Without ??-Transitions, 23th Symposium on Theoretical Aspects of Computer Science (STACS 2006), pp.432-443, 2006.
DOI : 10.1007/11672142_35
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.144.8301

K. Thompson, Programming Techniques: Regular expression search algorithm, Communications of the ACM, vol.11, issue.6, pp.419-422, 1968.
DOI : 10.1145/363347.363387