Pages that link to "Item:Q1063423"
From MaRDI portal
The following pages link to The smallest automaton recognizing the subwords of a text (Q1063423):
Displayed 12 items.
- Online algorithms for constructing linear-size suffix trie (Q5088922) (← links)
- Speeding up two string-matching algorithms (Q5096813) (← links)
- On the Structure of Consistent Partitions of Substring Set of a Word (Q5321725) (← links)
- Multi-pattern matching algorithm with wildcards based on bit-parallelism (Q5371909) (← links)
- THE DESIGN PRINCIPLES AND ALGORITHMS OF A WEIGHTED GRAMMAR LIBRARY (Q5462113) (← links)
- FORMAL MODELLING OF VIRAL GENE COMPRESSION (Q5462117) (← links)
- COMBINATORIAL CHARACTERIZATION OF THE LANGUAGE RECOGNIZED BY FACTOR AND SUFFIX ORACLES (Q5714666) (← links)
- The palindromization map (Q6048431) (← links)
- Nearly \(k\)-universal words -- investigating a part of Simon's congruence (Q6073651) (← links)
- Inferring strings from position heaps in linear time (Q6091154) (← links)
- Linear-time computation of DAWGs, symmetric indexing structures, and MAWs for integer alphabets (Q6093582) (← links)
- String matching algorithms and automata (Q6183618) (← links)