Efficient string matching: an aid to bibliographic search, Communications of the ACM, vol.18, issue.6, pp.6-333, 1975. ,
DOI : 10.1145/360825.360855
Minimal forbidden words and symbolic dynamics, STACS'96, pp.555-566, 1996. ,
DOI : 10.1007/3-540-60922-9_45
The smallest automation recognizing the subwords of a text, Theoretical Computer Science, vol.40, issue.1, pp.31-55, 1985. ,
DOI : 10.1016/0304-3975(85)90157-4
Reducing space for index implementation, Theoretical Computer Science, pp.185-197, 2003. ,
DOI : 10.1016/S0304-3975(01)00222-5
URL : https://hal.archives-ouvertes.fr/hal-00619518
Automata and forbidden words, Information Processing Letters, pp.111-117, 1998. ,
DOI : 10.1016/S0020-0190(98)00104-5
URL : https://hal.archives-ouvertes.fr/hal-00619578
Data compression using antidictonaries , in Special issue Lossless data compression,J .S t o r e re d . ,P r o c e e d i n g s of the IEEE, pp.1756-1768, 2000. ,
Direct construction of compact directed acyclic word graphs, LNCS, vol.1264, pp.116-129, 1997. ,
DOI : 10.1007/3-540-63220-4_55
URL : https://hal.archives-ouvertes.fr/hal-00620006
Some identities related to automata, determinants, and Möbius functions, STACS'96, pp.555-566, 1996. ,
Compact searchable static binary trees, Information Processing Letters, pp.49-52, 2004. ,
DOI : 10.1016/j.ipl.2003.09.013
On the Implementation of Compact DAWG's,i nP r o ceedings of the 7th Conference on Implementation and Application of Automata, LNCS, vol.2608, pp.289-294, 2002. ,
On-Line Construction of Compact Directed Acyclic Word Graphs, Discrete Applied Mathematics ,
On-Line Construction of Compact Directed Acyclic Word Graphs, Proceedings of CPM 2001,L N C S2089, pp.169-180, 2001. ,
Algebraic Combinatorics on Words. Encyclopedia of Mathematics and its Applications, 2002. ,
URL : https://hal.archives-ouvertes.fr/hal-00620608