Suffix automaton
Minimal DFA accepting set of all suffixes of particular string
Press Enter · cited answer in seconds
0 sources
Suffix automaton
Summary
Suffix automaton is a substring index[1]. It draws 25 Wikipedia views per month (substring_index category, ranking #1 of 1).[2]
Key Facts
- Suffix automaton is credited with the discovery of Anselm Cyril Blumer[3].
- Suffix automaton is credited with the discovery of Janet Blumer[4].
- Suffix automaton is credited with the discovery of Andrzej Ehrenfeucht[5].
- Suffix automaton is credited with the discovery of David Haussler[6].
- Suffix automaton is credited with the discovery of Ross McConnell[7].
- Suffix automaton's image is recorded as Suffix automaton for abbcbc.svg[8].
- Suffix automaton's instance of is recorded as substring index[9].
- Suffix automaton's subclass of is recorded as deterministic finite automata[10].
- Suffix automaton's Commons category is recorded as Suffix automaton[11].
- Suffix automaton's time of discovery or invention is recorded as +1983-00-00T00:00:00Z[12].
- Suffix automaton's Freebase ID is recorded as /m/0121svzq[13].
- Suffix automaton's native label is recorded as {'lang': 'en', 'text': 'suffix automaton'}[14].
- Suffix automaton's native label is recorded as {'lang': 'en', 'text': 'directed acyclic word graph'}[15].
- Suffix automaton's worst-case space complexity is recorded as O(n)[16].
- Suffix automaton's Dictionary of Algorithms and Data Structures ID is recorded as suffixautmtn[17].
- Suffix automaton's Microsoft Academic ID is recorded as 2781143584[18].
Why It Matters
Suffix automaton draws 25 Wikipedia views per month (substring_index category, ranking #1 of 1).[2]