{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T19:00:23Z","timestamp":1768676423408,"version":"3.49.0"},"reference-count":3,"publisher":"World Scientific Pub Co Pte Lt","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2008,2]]},"abstract":"<jats:p> 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 leastL. 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. <\/jats:p>","DOI":"10.1142\/s0129054108005619","type":"journal-article","created":{"date-parts":[[2008,2,20]],"date-time":"2008-02-20T09:46:31Z","timestamp":1203500791000},"page":"185-193","source":"Crossref","is-referenced-by-count":2,"title":["EFFICIENT AUTOMATA CONSTRUCTIONS AND APPROXIMATE AUTOMATA"],"prefix":"10.1142","volume":"19","author":[{"given":"BRUCE W.","family":"WATSON","sequence":"first","affiliation":[{"name":"FASTAR Research group, Department of Computer Science, University of Pretoria, Pretoria, 0002, South Africa"},{"name":"FST Labs Inc., Kelowna, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"DERRICK G.","family":"KOURIE","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Pretoria, Pretoria, 0002, South Africa"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"TINUS","family":"STRAUSS","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Pretoria, Pretoria, 0002, South Africa"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"ERNEST","family":"KETCHA","sequence":"additional","affiliation":[{"name":"School of Computing, University of South Africa, Pretoria, 0002, South Africa"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"LOEK","family":"CLEOPHAS","sequence":"additional","affiliation":[{"name":"Faculty of Computing Science and Mathematics, Eindhoven University of Technology, Eindhoven, Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1145\/321239.321249"},{"key":"rf4","volume-title":"Introduction to Algorithms","author":"Cormen T. H.","year":"2001"},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.1002\/spe.561"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054108005619","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T15:29:29Z","timestamp":1565191769000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054108005619"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,2]]},"references-count":3,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2008,2]]}},"alternative-id":["10.1142\/S0129054108005619"],"URL":"https:\/\/doi.org\/10.1142\/s0129054108005619","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,2]]}}}