Deterministic finite automaton

Known as: Local automata, Deterministic finite autonoma, Deterministic finite-state machine 
("DFSA" redirects here. DFSA may also refer to Drug facilitated sexual assault.) In the theory of computation, a branch of theoretical computer… (More)
Wikipedia

Related topics

Related topics

50 relations
Alphabet (formal languages)Alternating finite automatonAutomata theoryAutomatic sequence
(More)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
A regular expression matching using non-deterministic finite automaton
This paper shows an implementation of CANSCID (Combined Architecture for Stream Categorization and Intrusion Detection). To… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 10
Is this relevant?
2009
2009
Methodology for Fast Pattern Matching by Deterministic Finite Automaton with Perfect Hashing
As the speed of current computer networks increases, it is necessary to protect networks by security systems such as firewalls… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table I
Is this relevant?
Highly Cited
2007
Highly Cited
2007
A hybrid finite automaton for practical deep packet inspection
Deterministic finite automata (DFAs) are widely used to perform regular expression matching in linear time. Several techniques… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
2006
2006
A Deterministic Finite Automaton for Faster Protein Hit Detection in BLAST
BLAST is the most popular bioinformatics tool and is used to run millions of queries each day. However, evaluating such queries… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • table 2
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Transforming BPEL into annotated deterministic finite state automata for service discovery
Web services advocate loosely coupled systems, although current loosely coupled applications are limited to stateless services… (More)
  • figure 2
  • figure 1
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Processing XML streams with deterministic automata and stream indexes
We consider the problem of evaluating a large number of XPath expressions on a stream of XML packets. We contribute two novel… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1998
1998
Learning Deterministic Finite Automaton with a Recurrent Neural Network
@BA C DFEHG DFIKJML7NPO)Q9RSDTJ!UWV X IKCZY;[WR\X]N ^ A`_aCZJcb [WC UdV @)N e [W[gf)DTRS[KE U"h i U j k @?l [KEH[mIdC"n"A!opJ E… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1996
Highly Cited
1996
Partial Derivatives of Regular Expressions and Finite Automaton Constructions
We introduce a notion of partial derivative of a regular expression and apply it to finite automaton constructions. The notion is… (More)
Is this relevant?
Highly Cited
1996
Highly Cited
1996
Constructing Deterministic Finite-State Automata in Recurrent Neural Networks
Recurrent neural networks that are <italic>trained</italic> to behave like deterministic finite-state automata (DFAs) can show… (More)
Is this relevant?
Highly Cited
1971
Highly Cited
1971
On the Bounds for State-Set Size in the Proofs of Equivalence Between Deterministic, Nondeterministic, and Two-Way Finite Automata
The bounds on state-set size in the proofs of the equivalence between nondeterministic and deterministic finite automata and… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 3
  • figure 5
Is this relevant?