Longest common factor of two words

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 249 LNCS, Issue , 1987, Pages 26-36

  Crochemore, Maxime ^a  

^a UNIVERSITÉ PARIS 13   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING ALGORITHMS; PATTERN MATCHING; THEOREM PROVING;

COMMON FACTORS; LINEAR-TIME ALGORITHMS; REAL TIME; SUFFIX AUTOMATA;

SOFTWARE DESIGN;

EID: 84976849754     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-17660-8_45     Document Type: Conference Paper

References (6)

1. J. BERSTEL, Transductions and context-free languages, Teubner, 1979.
2. A. BLUMER, J. EHRENFEUCHT, D. HAUSSLER, M.T. CHEN & J. SEIFEIRAS, The smallest automaton recognizing the subwords of a text, Theor. Comput. Sci. 40, 1 (1985) 31-56.
3. C. CHOFFRUT, On some combinatorial properties of metrics over the free monoid, in: [Combinatorics on words, Cumming ed., Academic Press, 1983].
4. M. CROCHEMORE, Transducers and repetitions, Theor. Comput. Sci. (1986) to appear.
5. D.E. KNUTH, J.H. MORRIS & V.R. PRATT, Fast pattern-matching in strings, SIAM J. Compt. 6, 2 (1977) 323-350.
6. A.O. SLISENKO, Detection of periodicities and string-matching in real time, J. of Soviet Mathematics 22, 3 (1983) 1316-1387.