Results 1  10
of
5,189
BCKalgebras and hyper BCKalgebras induced by deterministic finite automaton
 Iranian Journal of Mathematical Sciences and Informatics
"... Abstract. In this note first we define a BCKalgebra on the states of a deterministic finite automaton. Then we show that it is a BCKalgebra with condition (S) and also it is a positive implicative BCKalgebra. Then we find some quotient BCKalgebras of it. After that we introduce a hyper BCKalgeb ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
Abstract. In this note first we define a BCKalgebra on the states of a deterministic finite automaton. Then we show that it is a BCKalgebra with condition (S) and also it is a positive implicative BCKalgebra. Then we find some quotient BCKalgebras of it. After that we introduce a hyper BCK
Deterministic Finite Automaton for Scalable Traffic Identification: the Power of Compressing by Range
"... Abstract — Deep Packet Inspection (DPI) systems have been becoming an important element in traffic measurement ever since portbased classification was deemed no longer appropriate, due to protocol tunneling and misuses of welldefined ports. Current DPI systems express application signatures using ..."
Abstract
 Add to MetaCart
regular expressions and it is usual to perform pattern matching through the use of Finite Automaton (FA). Although DPI systems are essentially more accurate, they are also resourceintensive and do not scale well with link speeds. Looking to this area of interest, this paper proposes a novel Deterministic
Construction of a Minimal Deterministic Finite Automaton from a Regular Expression
"... This paper describes a method for constructing a minimal deterministic finite automaton (DFA) from a regular expression. It is based on a set of graph grammar rules for combining many graphs (DFA) to obtain another desired graph (DFA). The graph grammar rules are presented in the form of a parsing a ..."
Abstract
 Add to MetaCart
This paper describes a method for constructing a minimal deterministic finite automaton (DFA) from a regular expression. It is based on a set of graph grammar rules for combining many graphs (DFA) to obtain another desired graph (DFA). The graph grammar rules are presented in the form of a parsing
A deterministic finite automaton for faster protein hit detection in BLAST
 Journal of Computational Biology
, 2005
"... BLAST is the most popular bioinformatics tool and is used to run millions of queries each day. However, evaluating such queries is slow, taking typically minutes on modern workstations. Therefore, continuing evolution of BLAST — by improving its algorithms and optimisations — is essential to improve ..."
Abstract

Cited by 14 (3 self)
 Add to MetaCart
results for other popular architectures. Overall, this is a saving of around 15 % of the total typical BLAST search time. Our approach uses a deterministic finite automaton (DFA), inspired by the original scheme used in the 1990 BLAST algorithm. The techniques are optimised for modern hardware, making
Learning a Deterministic Finite Automaton With a Recurrent Neural Network
"... We consider the problem of learning a finite automaton with recurrent neural networks, given a training set of sentences in a language. We train Elman recurrent neural networks on the prediction task and study experimentally what these networks learn. We found that the network tends to encode an app ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
an approximation of the minimum automaton that accepts only the sentences in the training set. 1 Introduction 1.1 The problem of inducing a deterministic finite automaton (DFA) The interest in DFA inference is partly induced from the larger goal of explaining how humans learn the grammar rules of their native
An Algorithm for Minimizing a Completely Deterministic Finite Automaton Based on State Transition Inverse Mapping
"... Abstract—During the process of minimizing a deterministic finite automaton, there exist computing dependency and repetitive computing problems caused by the disorder of selecting a set to partition in the partition algorithm or by the disorder of computing statepairs in the combination algorithm. T ..."
Abstract
 Add to MetaCart
Abstract—During the process of minimizing a deterministic finite automaton, there exist computing dependency and repetitive computing problems caused by the disorder of selecting a set to partition in the partition algorithm or by the disorder of computing statepairs in the combination algorithm
Learning a deterministic finite automaton with a recurrent neural network
"... We consider the problem of learning a finite automaton with recurrent neural networks, given a training set of sentences in a language. We train Elman recurrent neural networks on the prediction task and study experimentally what these networks learn. We found that the network tends to encode an app ..."
Abstract
 Add to MetaCart
We consider the problem of learning a finite automaton with recurrent neural networks, given a training set of sentences in a language. We train Elman recurrent neural networks on the prediction task and study experimentally what these networks learn. We found that the network tends to encode
Methodology for Fast Pattern Matching by Deterministic Finite Automaton with Perfect Hashing Ondrej Lengal
"... AbstractAs the speed of current computer networks increases, it is necessary to protect networks by security systems such as firewalls and Intrusion Detection Systems operating at multigigabit speeds. Pattern matching is the timecritical operation of current IDS on multigigabit networks. Regular ..."
Abstract
 Add to MetaCart
expressions are often used to describe malicious network patterns. This paper deals with fast regular expression matching using the Deterministic Finite Automaton (DFA) with perfect hash function. We introduce decomposition of the problem on two parts: transformation of the input alphabet and usage of a fast
A regular expression matching circuit based on a modular nondeterministic finite automaton with multicharacter transition,” SASIMI’10,
, 2010
"... Abstract. In this paper, we propose a regular expression matching circuit based on a decomposed automaton. To implement a regular expression matching circuit, first, we convert regular expressions into a nondeterministic finite automaton (NFA). Then, to reduce the number of states, we convert the ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
Abstract. In this paper, we propose a regular expression matching circuit based on a decomposed automaton. To implement a regular expression matching circuit, first, we convert regular expressions into a nondeterministic finite automaton (NFA). Then, to reduce the number of states, we convert
Algorithms finding the order of local testability of deterministic finite automaton and estimation of the order, Theoret
 Comput. Sci
"... In this paper, algorithms to verify 2testability of order O(n3), 3testability of order O(n4) and jtestability for j? 3 of order O(nj+1) are presented. An O(nn+2) time algorithm of finding the precise order of local testability is described. The time complexity of the algorithms improves on the pr ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
on the previously known algorithms. We give necessary and sufficient conditions for an automaton to be ktestable in terms of the length of paths of related graphs. Some estimates of the upper and of the lower bound on the order of local testability follow.
Results 1  10
of
5,189