Pages that link to "Item:Q3625694"
From MaRDI portal
The following pages link to Efficient validation and construction of border arrays and validation of string matching automata (Q3625694):
Displaying 11 items.
- Inferring strings from suffix trees and links on a binary alphabet (Q496548) (← links)
- Combinatorics on partial word borders (Q897922) (← links)
- Validating the Knuth-Morris-Pratt failure function, fast and online (Q1678758) (← links)
- Recognizing union-find trees is NP-complete (Q1685019) (← links)
- String inference from longest-common-prefix array (Q2110373) (← links)
- Universal reconstruction of a string (Q2297860) (← links)
- A suffix tree or not a suffix tree? (Q2343297) (← links)
- Inferring strings from Lyndon factorization (Q2402270) (← links)
- Representing prefix and border tables: results on enumeration (Q2971066) (← links)
- Universal Reconstruction of a String (Q3449836) (← links)
- Recognizing Union-Find Trees is NP-Complete, Even Without Rank Info (Q5205041) (← links)
