The following pages link to Transducers and repetitions (Q1820587):
Displaying 20 items.
- WEIGHTED AUTOMATA FOR FULL-TEXT INDEXING (Q3016225) (← links)
- (Q3165665) (← links)
- (Q3165666) (← links)
- ONLINE AND DYNAMIC RECOGNITION OF SQUAREFREE STRINGS (Q3434282) (← links)
- THE STRUCTURE OF FACTOR ORACLES (Q3503093) (← links)
- (Q4013088) (← links)
- Efficient string matching on packed texts (Q4341037) (← links)
- A Heuristic For Computing Repeats With A Factor Oracle: Application To Biological Sequences (Q4792964) (← links)
- Forty Years of Text Indexing (Q4928554) (← links)
- (Q4955257) (← links)
- A Linear-Time Algorithm for Seeds Computation (Q4987445) (← links)
- Speeding up two string-matching algorithms (Q5096813) (← links)
- Transducers with Origin Information (Q5167824) (← links)
- Optimal parallel algorithms for periods, palindromes and squares (Q5204325) (← links)
- On the Structure of Consistent Partitions of Substring Set of a Word (Q5321725) (← links)
- THE DESIGN PRINCIPLES AND ALGORITHMS OF A WEIGHTED GRAMMAR LIBRARY (Q5462113) (← links)
- Minimal forbidden factors of circular words (Q5915743) (← links)
- Finding similar consensus between trees: An algorithm and a distance hierarchy (Q5926038) (← links)
- Identifying consensus of trees through alignment (Q5938834) (← links)
- Linear-time computation of DAWGs, symmetric indexing structures, and MAWs for integer alphabets (Q6093582) (← links)
