Results 1  10
of
239,710
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 5 (0 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 12 (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
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.
RESEARCH ARTICLE A MemoryEfficient Deterministic Finite AutomatonBased BitSplit String Matching Scheme Using Pattern Uniqueness in Deep Packet Inspection
"... This paper proposes a memoryefficient bitsplit string matching scheme for deep packet inspection (DPI). When the number of target patterns becomes large, the memory requirements of the string matching engine become a critical issue. The proposed string matching scheme reduces the memory requirem ..."
Abstract
 Add to MetaCart
requirements using the uniqueness of the target patterns in the deterministic finite automaton (DFA)based bitsplit string matching. The pattern grouping extracts a set of unique patterns from the target patterns. In the set of unique patterns, a pattern is not the suffix of any other patterns. Therefore
Mathematical Control Theory: Deterministic Finite Dimensional Systems
 of Texts in Applied Mathematics
, 1990
"... The title of this book gives a very good description of its contents and style, although I might have added “Introduction to ” at the beginning. The style is mathematical: precise, clear statements (i.e., theorems) are asserted, then carefully proved. The book covers many of the key topics in contro ..."
Abstract

Cited by 485 (122 self)
 Add to MetaCart
The title of this book gives a very good description of its contents and style, although I might have added “Introduction to ” at the beginning. The style is mathematical: precise, clear statements (i.e., theorems) are asserted, then carefully proved. The book covers many of the key topics in control theory, except — as the subtitle has warned us — those involving stochastic processes or infinitedimensional systems. The level is appropriate for a senior
Results 1  10
of
239,710