Ciura, M.G., Deorowicz, S.,
"How to squeeze a lexicon",
Software -- Practice and experience, 31, 11, pp. 1077-1090, September 2001.
|1077 ;;Quote: use acyclic finite automata as compact recognizers of a lexicon; time and space efficient; better than tries
ThesaHelp: references c-d (337 items)
Topic: state machine (67 items)
Topic: lexical analysis (14 items)