Detecting the morphic images of a word : improving the general algorithm
From MaRDI portal
Publication:4348237
DOI10.1051/ITA/1997310100011zbMATH Open0878.68079OpenAlexW174336689MaRDI QIDQ4348237FDOQ4348237
Authors: J. Néraud
Publication date: 14 December 1997
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/92553
Recommendations
Cites Work
- Efficient string matching
- Title not available (Why is that?)
- Title not available (Why is that?)
- Finding patterns common to a set of strings
- An optimal algorithm for computing the repetitions in a word
- Optimal off-line detection of repetitions in a string
- Title not available (Why is that?)
- Fast Pattern Matching in Strings
- Title not available (Why is that?)
- Title not available (Why is that?)
- Decision problems for patterns
- Saving Space in Fast String-Matching
- Usefulness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arrays
- Title not available (Why is that?)
- Title not available (Why is that?)
- Algorithms for detecting morphic images of a word
- Detecting morphic images of a word: On the rank of a pattern
Cited In (1)
This page was built for publication: Detecting the morphic images of a word : improving the general algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4348237)