Andrew Gallant personal blog
Finite state machines as data structure for representing ordered sets and maps
It turns out that finite state machines are useful for things other than expressing computation. Finite state machines can also be used to compactly represent ordered sets or maps of strings that can be searched very quickly.
- Points
- 213
- HN comments
- 37
- Submissions
- 3
- Cited by
- 17 commenters
Math & AlgorithmsSoftware Engineering2015
On Hacker News
| Submitted | Title on HN | Points | Comments |
|---|---|---|---|
| Nov 12, 2015 | Finite state machines as data structure for representing ordered sets and maps by dbaupp | 213 | 25 |
| Aug 20, 2021 | Index 1.6B Keys with Automata and Rust (2015) by ithkuil | 174 | 10 |
| Feb 17, 2017 | Index 1.6B Keys with Automata and Rust (2015) by nanxor | 82 | 2 |
Cited in comments
Linked from 20 Hacker News comments by 17 different people, from Nov 2015 to Nov 2023.
Most recent:
- akprasad · Nov 27, 2023
- marvin-hansen · Nov 1, 2023
- nextaccountic · Aug 29, 2023
- Xeoncross · Feb 28, 2023
- jstrieb · Nov 12, 2022
- Xeoncross · Sep 8, 2022
