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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
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
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
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
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
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
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
@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
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
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
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?