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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Deciding the equivalence of regular expressions is a fundamental problem of theoretical computer science. On one hand, there are… Expand
  • figure 2
2016
2016
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
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
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
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