Results 1 - 10 of 108

Importance of Aho-Corasick String Matching Algorithm in Real World Applications

by Saima Hasib, Mahak Motwani, Amit Saxena
"... Abstract: String matching problem is to find all the occurrences of a given string pattern in a large string text. This problem is fundamental in computer Science and is the basic need of many applications, one of the most popular Multipattern String Matching Algorithm is “Aho-Corasick”; based on co ..."
Abstract - Add to MetaCart
on constructing DFA (Deterministic Finite Automata) between pattern characters, It is an exact matching algorithm. In this paper we will discuss the working of “Aho-Corasick ” algorithm with its advantages, disadvantages and various application areas like intrusion detection, detecting plagiarism, bioinformatics

Failure deterministic finite automata

by Derrick G. Kourie, Bruce W. Watson, Loek Cleophas, Fritz Venter , 2012
"... Abstract. Inspired by failure functions found in classical pattern matching algorithms, a failure deterministic finite automaton (FDFA) is defined as a formalism to recognise a regular language. An algorithm, based on formal concept analysis, is proposed for de-riving from a given deterministic fini ..."
Abstract - Cited by 3 (2 self) - Add to MetaCart
Abstract. Inspired by failure functions found in classical pattern matching algorithms, a failure deterministic finite automaton (FDFA) is defined as a formalism to recognise a regular language. An algorithm, based on formal concept analysis, is proposed for de-riving from a given deterministic

Active coevolutionary learning of deterministic finite automata

by Josh Bongard, Hod Lipson, Stefan Wrobel - Journal of Machine Learning Research , 2005
"... This paper describes an active learning approach to the problem of grammatical inference, specifically the inference of deterministic finite automata (DFAs). We refer to the algorithm as the estimation-exploration algorithm (EEA). This approach differs from previous passive and active learning appro ..."
Abstract - Cited by 36 (9 self) - Add to MetaCart
This paper describes an active learning approach to the problem of grammatical inference, specifically the inference of deterministic finite automata (DFAs). We refer to the algorithm as the estimation-exploration algorithm (EEA). This approach differs from previous passive and active learning

Enumeration and Generation of Initially Connected Deterministic Finite Automata ∗

by Marco Almeida, Nelma Moreira, Rogério Reis, Rua Do Campo Alegre, Marco Almeida, Nelma Moreira, Rogério Reis
"... The representation of combinatorial objects is decisive for the feasibility of several enumerative tasks. In this work, we present a (unique) string representation for (complete) initially-connected deterministic automata (ICDFA’s) with n states over an alphabet of k symbols. For these strings we gi ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
of minimal automata (and thus of regular languages). A uniform random generator for ICDFA’s is presented that uses a table of pre-calculated values. Based on the same table, an optimal coding for ICDFA’s is obtained. We also establish an explicit relationship between our method and the one used by Nicaud et

Minimizing Deterministic Lattice Automata

by Shulamit Halamish, Orna Kupferman
"... Abstract. Traditional automata accept or reject their input, and are therefore Boolean. In contrast, weighted automata map each word to a value from a semiring over a large domain. The special case of lattice automata, in which the semiring is a finite lattice, has interesting theoretical properties ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
automata is of great interest, both theoretically and in practice. For traditional automata on finite words, a minimization algorithm, based on the Myhill-Nerode right congruence on the set of words, generates in polynomial time a canonical minimal deterministic automaton. A polynomial algorithm is known

An Improved Algorithm for the Metamorphosis of Semi-Extended Regular Expressions to Deterministic Finite Automata

by Ajay Kumar, Anil Kumar Verma , 2013
"... Semi-extended regular expressions are regular expressions with intersection, union, concatenation and Kleene closure operators. The aim of this paper is the metamorphosis of semi-extended regular expressions to deterministic finite automata. The proposed algorithm is based on the follow-positions of ..."
Abstract - Add to MetaCart
Semi-extended regular expressions are regular expressions with intersection, union, concatenation and Kleene closure operators. The aim of this paper is the metamorphosis of semi-extended regular expressions to deterministic finite automata. The proposed algorithm is based on the follow

An Efficient TCAM-Based Implementation of Multipattern Matching Using Covered State Encoding

by Sangkyun Yun, Ieee Computer Society
"... Abstract—This paper proposes a state encoding scheme called a covered state encoding for the efficient TCAM-based implementation of the Aho-Corasick multipattern matching algorithm, which is widely used in network intrusion detection systems. Since the information of failure transitions of the Aho-C ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
Abstract—This paper proposes a state encoding scheme called a covered state encoding for the efficient TCAM-based implementation of the Aho-Corasick multipattern matching algorithm, which is widely used in network intrusion detection systems. Since the information of failure transitions of the Aho-Corasick

doi:10.1093/comjnl/bxu049 An Improved Algorithm for the Metamorphosis of Semi-Extended Regular Expressions to Deterministic Finite Automata

by Ajay Kumar, Anil Kumar Verma , 2013
"... Semi-extended regular expressions are regular expressions with intersection, union, concatenation and Kleene closure operators. The aim of this paper is the metamorphosis of semi-extended regular expressions to deterministic finite automata. The proposed algorithm is based on the follow-positions of ..."
Abstract - Add to MetaCart
Semi-extended regular expressions are regular expressions with intersection, union, concatenation and Kleene closure operators. The aim of this paper is the metamorphosis of semi-extended regular expressions to deterministic finite automata. The proposed algorithm is based on the follow

Accepted Manuscript Compression of finite-state automata through failure transitions Compression of finite-state automata through failure transitions

by H Björklund , J Björklund , N Zechner , 2014
"... Please cite this article in press as: H. Björklund et al., Compression of finite-state automata through failure transitions, Theor. Comput. Sci. (2014), http://dx.doi.org/10.1016/j.tcs. 2014.09.007 This is a PDF file of an unedited manuscript that has been accepted for publication. As a service ..."
Abstract - Add to MetaCart
, and all legal disclaimers that apply to the journal pertain. Compression of finite Abstract Several linear-time algorithms for automata-based pattern matching rely on failure transitions for efficient back-tracking. Like epsilon transitions, failure transition do not consume input symbols, but unlike

Evaluating linear XPath expressions by pattern-matching automata

by Panu Silvasti , Seppo Sippu , Eljas Soisalon-Soininen - J. UCS , 2010
"... Abstract: We consider the problem of efficiently evaluating a large number of XPath expressions, especially in the case when they define subscriber profiles for filtering of XML documents. For each document in an XML document stream, the task is to determine those profiles that match the document. ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
. In this article we present a new general method for filtering with profiles expressed by linear XPath expressions with child operators (/), descendant operators (//), and wildcards ( * ). This new filtering algorithm is based on a backtracking deterministic finite automaton derived from the classic Aho-Corasick
Results 1 - 10 of 108