Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Related topics

Related topics

50 relations
Alternating finite automatonAutomata theoryAutomatic sequenceChomsky–Schützenberger representation theorem
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
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… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Highly Cited
2006
Highly Cited
2006
Fast and memory-efficient regular expression matching for deep packet inspection
Packet content scanning at high speed has become extremely important due to its applications in network security, network… Expand
  • table 1
  • table 3
  • table 4
  • figure 1
  • figure 2
Highly Cited
1999
Highly Cited
1999
Parallel Computer Architecture: A Hardware/Software Approach
enter the circuit several times, possibly via different input processors. More elaborate combinatorial considerations than for… Expand
Highly Cited
1996
Highly Cited
1996
Partial Derivatives of Regular Expressions and Finite Automaton Constructions
We introduce a notion of a partial derivative of a regular expression. It is a generalization to the non-deterministic case of… Expand
Highly Cited
1994
Highly Cited
1994
Cryptographic limitations on learning Boolean formulae and finite automata
In this paper, we prove the intractability of learning several classes of Boolean functions in the distribution-free model (also… Expand
Highly Cited
1993
Highly Cited
1993
Minimal NFA Problems are Hard
Finite automata (FA’s) are of fundamental importance in theory and in applications. The following basic minimization problem is… Expand
Highly Cited
1990
Highly Cited
1990
Prediction-Preserving Reducibility
We investigate a model of polynomial-time concept prediction which is a relaxation of the distribution-independent model of… Expand
Highly Cited
1988
Highly Cited
1988
A Protocol Test Generation Procedure
Abstract A procedure presented here generates test sequences for checking the conformity of an implementation to the control… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Highly Cited
1985
Highly Cited
1985
The Smallest Automaton Recognizing the Subwords of a Text
Let a partial deterministic finite automaton be a DFA in which each state need not have a transition edge for each letter of the… Expand
  • figure 2
  • figure 2
  • figure 3
  • figure 3
  • figure 4
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
  • F. R. Moore
  • IEEE Transactions on Computers
  • 1971
    • Corpus ID: 206618275
The bounds on state-set size in the proofs of the equivalence between nondeterministic and deterministic finite automata and… Expand
  • figure 1
  • figure 2
  • figure 4
  • figure 3
  • figure 5
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE