×

Efficient automata constructions and approximate automata. (English) Zbl 1169.68026

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.

MSC:

68Q45 Formal languages and automata

Software:

FIRE station
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] DOI: 10.1145/321239.321249 · Zbl 0225.94044 · doi:10.1145/321239.321249
[2] Cormen T. H., Introduction to Algorithms (2001) · Zbl 1047.68161
[3] DOI: 10.1002/spe.561 · Zbl 02060613 · doi:10.1002/spe.561
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.