La reconnaissance des facteurs d'un mot dans un texte

DOI10.1016/0304-3975(86)90082-4MaRDI QIDQ580994zbMATH OpenOpenAlexFDO

Authors Jean-Claude Spehner

Publication date 1986

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-3975(86)90082-4

zbMATH Keywords

algorithmoccurrences of the factors of a given word in a textstring-matching

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Review text

We give an algorithm which finds all occurrences of the factors of a given word in a text in time linear in the length of the text.

Cites work

• A fast string searching algorithm
• A Space-Economical Suffix Tree Construction Algorithm
• Efficient string matching
• Fast Pattern Matching in Strings
• scientific article; zbMATH DE number 3883638 (Why is no real title available?)
• scientific article; zbMATH DE number 3811868 (Why is no real title available?)
• scientific article; zbMATH DE number 3917745 (Why is no real title available?)
• scientific article; zbMATH DE number 3660804 (Why is no real title available?)
• scientific article; zbMATH DE number 3497806 (Why is no real title available?)
• scientific article; zbMATH DE number 1988957 (Why is no real title available?)
• Linear Automaton Transformations
• The smallest automaton recognizing the subwords of a text
• Transducers and repetitions

Cited in

(1)

• La reconnaissance des facteurs d'un langage fini dans un texte en temps linéaire. (Recognition of the factors of a finite language in a text in linear time)

This page was built for publication: La reconnaissance des facteurs d'un mot dans un texte

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q580994)