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)

DOI10.1016/0304-3975(88)90116-8zbMath0663.68090OpenAlexW2094579735MaRDI QIDQ1115203

Jean-Claude Spehner

Publication date: 1988

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

Full work available at URL: https://doi.org/10.1016/0304-3975(88)90116-8

Mathematics Subject Classification ID

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

Related Items (1)

Sur les automates qui reconnaissent une famille de langages. (On the automata which accept a family of languages)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• La reconnaissance des facteurs d'un mot dans un texte
• The smallest automaton recognizing the subwords of a text
• Sur les automates qui reconnaissent une famille de langages. (On the automata which accept a family of languages)
• 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
• Complete inverted files for efficient text retrieval and analysis

This page was built for publication: 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)