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

NFA to DFA conversion

A non-deterministic finite automaton can be converted into a deterministic finite automaton using several methods, such as the powerset construction… Expand
Wikipedia

Related topics

Related topics

2 relations
Deterministic finite automatonPowerset construction

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Computing Certificates of Regular Expression Equivalence
Deciding the equivalence of regular expressions is a fundamental problem of theoretical computer science. On one hand, there are… Expand
  • figure 2
2016
2016
Interpreting the Subset Construction Using Finite Sublanguages
We present a language-based approach to the well-known problem of the conversion between finite automaton (FA) types. We base our… Expand
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 4
2009
2009
Analysis of Bit-Split Languages for Packet Scanning and Experiments with Wildcard Matching
Monitoring traffic payloads to detect the occurrence of suspicious patterns has proven to be a useful and necessary tool for… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
2008
2008
State Complexity of NFA to DFA Conversion of Subregular Language Families
 
2008
2008
Automata-Theoretic Analysis of Bit-Split Languages for Packet Scanning
Bit-splitting breaks the problem of monitoring traffic payloads to detect the occurrence of suspicious patterns into several… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
2006
Highly Cited
2006
Regular Expression Software Deceleration for Intrusion Detection Systems
The use of reconfigurable hardware for network security applications has recently made great strides as FPGA devices have… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 4
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