The following pages link to Transducers and repetitions (Q1820587):
Displaying 50 items.
- Sequence binary decision diagram: minimization, relationship to acyclic automata, and complexities of Boolean set operations (Q313770) (← links)
- On-line construction of position heaps (Q396632) (← links)
- Efficient algorithms for three variants of the LPF table (Q414447) (← links)
- An efficient algorithm to test square-freeness of strings compressed by straight-line programs (Q456098) (← links)
- Text searching allowing for inversions and translocations of factors (Q496536) (← links)
- New simple efficient algorithms computing powers and runs in strings (Q496538) (← links)
- The ``runs'' conjecture (Q544875) (← links)
- Special factors and the combinatorics of suffix and factor automata (Q551186) (← links)
- La reconnaissance des facteurs d'un mot dans un texte (Q580994) (← links)
- Approximate string matching with suffix automata (Q689099) (← links)
- Ternary directed acyclic word graphs (Q703500) (← links)
- On suffix extensions in suffix trees (Q714837) (← links)
- Lempel-Ziv factorization powered by space efficient suffix trees (Q724218) (← links)
- A metric index for approximate string matching (Q818138) (← links)
- A fast algorithm for finding the positions of all squares in a run-length encoded string (Q837185) (← links)
- From Nerode's congruence to suffix automata with mismatches (Q840766) (← links)
- General suffix automaton construction algorithm and space bounds (Q840781) (← links)
- An efficient algorithm for online square detection (Q860815) (← links)
- Parallel construction of minimal suffix and factor automata (Q911778) (← links)
- Efficient on-line repetition detection (Q955034) (← links)
- Computing longest previous factor in linear time and applications (Q963336) (← links)
- A faster algorithm for matching a set of patterns with variable length don't cares (Q991757) (← links)
- Repetitions in strings: algorithms and combinatorics (Q1034529) (← 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)
- Usefulness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arrays (Q1177175) (← links)
- Efficient parallel algorithms to test square-freeness and factorize strings (Q1178198) (← links)
- A variation on the Boyer-Moore algorithm (Q1190458) (← links)
- A string-matching interpretation of the equation \(x^ m y^ n = z^ p\) (Q1190459) (← links)
- Approximate string-matching with \(q\)-grams and maximal matches (Q1190465) (← links)
- Data compression with factor automata (Q1190467) (← links)
- Speeding up two string-matching algorithms (Q1336956) (← links)
- Matching a set of strings with variable length don't cares (Q1391531) (← links)
- Fibonacci arrays and their two-dimensional repetitions (Q1566729) (← links)
- Computing the longest previous factor (Q1761495) (← links)
- On-line construction of compact directed acyclic word graphs (Q1764897) (← links)
- Linear time algorithms for finding and representing all the tandem repeats in a string (Q1765295) (← links)
- The wide window string matching algorithm (Q1770398) (← links)
- Reducing space for index implementation. (Q1853739) (← links)
- On-line construction of suffix trees (Q1897476) (← links)
- Covering a string (Q1924404) (← links)
- Computing longest previous non-overlapping factors (Q1944092) (← links)
- Minimisation of automata (Q2074212) (← links)
- Fully-online suffix tree and directed acyclic word graph construction for multiple texts (Q2309475) (← links)
- The number of runs in a string (Q2381507) (← links)
- Indexing text with approximate \(q\)-grams (Q2569395) (← links)
- Optimal discovery of repetitions in 2D (Q2573235) (← links)
- Parameterized DAWGs: efficient constructions and bidirectional pattern searches (Q2676460) (← links)
- Online Detection of Repetitions with Backtracking (Q2942265) (← links)
- A Faster Algorithm for Computing Maximal $$\alpha $$-gapped Repeats in a String (Q2949836) (← links)
- WEIGHTED AUTOMATA FOR FULL-TEXT INDEXING (Q3016225) (← links)
