Pages that link to "Item:Q1063423"
From MaRDI portal
The following pages link to The smallest automaton recognizing the subwords of a text (Q1063423):
Displaying 50 items.
- Linear-size suffix tries (Q294967) (← links)
- Sequence binary decision diagram: minimization, relationship to acyclic automata, and complexities of Boolean set operations (Q313770) (← links)
- Compressed directed acyclic word graph with application in local alignment (Q378207) (← links)
- On-line construction of position heaps (Q396632) (← links)
- On the structure of compacted subword graphs of Thue-Morse words and their applications (Q414440) (← links)
- Text searching allowing for inversions and translocations of factors (Q496536) (← 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)
- Verifying and enumerating parameterized border arrays (Q650937) (← links)
- Approximate string matching with suffix automata (Q689099) (← links)
- Ternary directed acyclic word graphs (Q703500) (← links)
- Characteristic Sturmian words are extremal for the critical factorization theorem (Q714825) (← links)
- On suffix extensions in suffix trees (Q714837) (← links)
- From Nerode's congruence to suffix automata with mismatches (Q840766) (← links)
- General suffix automaton construction algorithm and space bounds (Q840781) (← links)
- Efficient parameterized string matching (Q845838) (← links)
- On Sturmian graphs (Q881581) (← links)
- Parallel construction of minimal suffix and factor automata (Q911778) (← links)
- A faster algorithm for matching a set of patterns with variable length don't cares (Q991757) (← links)
- Discovering subword associations in strings in time linear in the output size (Q1026231) (← links)
- A new distance metric on strings computable in linear time (Q1102764) (← 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)
- A variation on the Boyer-Moore algorithm (Q1190458) (← 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)
- Normal forms of quasiperiodic strings (Q1583537) (← links)
- Words and forbidden factors (Q1605329) (← links)
- \(xkcd\)-repeats: a new taxonomy of repeats defined by their context diversity (Q1748195) (← links)
- On-line construction of compact directed acyclic word graphs (Q1764897) (← links)
- Transducers and repetitions (Q1820587) (← links)
- Average sizes of suffix trees and DAWGs (Q1822940) (← links)
- A speed-up for the commute between subword trees and DAWGs. (Q1853059) (← links)
- Reducing space for index implementation. (Q1853739) (← links)
- Compact recognizers of episode sequences (Q1854526) (← links)
- On-line construction of suffix trees (Q1897476) (← links)
- Covering a string (Q1924404) (← links)
- Minimisation of automata (Q2074212) (← links)
- Nearly \(k\)-universal words -- investigating a part of Simon's congruence (Q2112180) (← links)
- Maximum order complexity of the sum of digits function in Zeckendorf base and polynomial subsequences (Q2121010) (← links)
- Combinatorics of minimal absent words for a sliding window (Q2163388) (← links)
- A brief history of parameterized matching problems (Q2295633) (← links)
- Fully-online suffix tree and directed acyclic word graph construction for multiple texts (Q2309475) (← links)
- Efficient dynamic dictionary matching with DAWGs and AC-automata (Q2326393) (← links)
- Efficient computation of substring equivalence classes with suffix arrays (Q2408913) (← links)
- Dynamic construction of an antidictionary with linear complexity (Q2437769) (← links)
- Motif patterns in 2D (Q2474071) (← links)
- Constructing suffix arrays in linear time (Q2569391) (← links)
- Indexing text with approximate \(q\)-grams (Q2569395) (← links)