\input zb-basic
\input zb-ioport
\iteman{io-port 05360164}
\itemau{Watson, Bruce W.; Kourie, Derrick G.; Strauss, Tinus; Ketcha, Ernest; Cleophas, Loek}
\itemti{Efficient automata constructions and approximate automata.}
\itemso{Int. J. Found. Comput. Sci. 19, No. 1, 185-193 (2008).}
\itemab
Summary: In this paper, we present data structures and algorithms for efficiently constructing approximate automata. An approximate automaton for a regular language $L$ is one which accepts at least $L$. Such automata can be used in a variety of practical applications, including network security pattern matching, in which false-matches are only a performance nuisance. The construction algorithm is particularly efficient, and is tunable to yield more or less exact automata.
\itemrv{~}
\itemcc{}
\itemut{memory efficiency; hash functions}
\itemli{doi:10.1142/S0129054108005619}
\end