Pages that link to "Item:Q1127317"
From MaRDI portal
The following pages link to The suffix tree of a tree and minimizing sequential transducers (Q1127317):
Displaying 14 items.
- Longest common extensions in trees (Q294947) (← links)
- Efficiently computing runs on a trie (Q820550) (← links)
- Converting suffix trees into factor/suffix oracles (Q935847) (← links)
- On updating suffix tree labels (Q1129015) (← links)
- A proof of Choffrut's theorem on subsequential functions (Q1285595) (← links)
- Minimization algorithms for sequential transducers (Q1575676) (← links)
- Determinization of transducers over finite and infinite words. (Q1853526) (← links)
- Minimizing subsequential transducers: a survey. (Q1853736) (← links)
- Solving string problems on graphs using the labeled direct product (Q2088591) (← links)
- Constructing LZ78 tries and position heaps in linear time for large alphabets (Q2346553) (← links)
- Computing the prefix of an automaton (Q2729627) (← links)
- Longest Common Extensions in Trees (Q2942245) (← links)
- From Suffix Trees to Suffix Vectors (Q3421852) (← links)
- Computing runs on a trie (Q5088914) (← links)