The following pages link to (Q3217631):
Displayed 19 items.
- Special factors and the combinatorics of suffix and factor automata (Q551186) (← links)
- La reconnaissance des facteurs d'un mot dans un texte (Q580994) (← links)
- The smallest automaton recognizing the subwords of a text (Q1063423) (← links)
- Le calcul rapide des mélanges de deux mots. (Fast computing of the shuffle of two words) (Q1099640) (← links)
- 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) (Q1115203) (← links)
- Optimal insertion in deterministic DAWGs (Q1399983) (← links)
- Average sizes of suffix trees and DAWGs (Q1822940) (← links)
- Discovering characteristic expressions in literary works. (Q1870549) (← links)
- Pseudorandom sequences derived from automatic sequences (Q2154881) (← links)
- Sliding suffix tree (Q2331636) (← links)
- Efficient computation of substring equivalence classes with suffix arrays (Q2408913) (← links)
- Time-Optimal Top-$k$ Document Retrieval (Q2963583) (← links)
- (Q3165665) (← links)
- Contracted Suffix Trees: A Simple and Dynamic Text Indexing Data Structure (Q3637103) (← links)
- Forty Years of Text Indexing (Q4928554) (← links)
- Fast Label Extraction in the CDAWG (Q5150929) (← links)
- Linear-Size CDAWG: New Repetition-Aware Indexing and Grammar Compression (Q5150942) (← links)
- On the Structure of Consistent Partitions of Substring Set of a Word (Q5321725) (← links)
- (Q5743458) (← links)