La reconnaissance des facteurs d'un mot dans un texte

DOI10.1016/0304-3975(86)90082-4zbMath0626.68058OpenAlexW1965163477MaRDI QIDQ580994

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

algorithmstring-matchingoccurrences of the factors of a given word in a text

Mathematics Subject Classification ID

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

Related Items (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)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The smallest automaton recognizing the subwords of a text
• Transducers and repetitions
• A fast string searching algorithm
• Linear Automaton Transformations
• Efficient string matching
• A Space-Economical Suffix Tree Construction Algorithm
• Fast Pattern Matching in Strings

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