Paper Info
Title
Fuzzified Aho-Corasick search automata
Abstract
In this paper, we discuss the need for efficient approximate string matching. We present the well-known Aho-Corasick automaton for locating multiple patterns and discuss an approach for fuzzification of this automaton. Along with some motivational examples, we propose and illustrate a novel algorithm for automaton construction.
Year
DOI
Venue
2010
10.1109/ISIAS.2010.5604076
Information Assurance and Security
Keywords
Field
DocType
automata theory,fuzzy set theory,search problems,string matching,approximate string matching,fuzzified Aho-Corasick search automata
Two-way deterministic finite automaton,Nondeterministic finite automaton,Deterministic automaton,Mobile automaton,Computer science,Powerset construction,Computer network,Algorithm,Theoretical computer science,Timed automaton,Probabilistic automaton,Büchi automaton
Conference
ISBN
Citations 
PageRank 
978-1-4244-7407-3
0
0.34
References 
Authors
2
4
Name
Order
Citations
PageRank
Zdenek Horak18712.96
Václav Snasel21261210.53
Ajith Abraham38954729.23
ella Hassanien, A.4364.57