Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,209,286 papers from all fields of science
Search
Sign In
Create Free Account
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
2 relations
Deterministic finite automaton
Powerset construction
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Computing Certificates of Regular Expression Equivalence
Benoît Razet
,
Bodhayan Roy
2016
Corpus ID: 27165263
Deciding the equivalence of regular expressions is a fundamental problem of theoretical computer science. On one hand, there are…
Expand
2009
2009
Analysis of Bit-Split Languages for Packet Scanning and Experiments with Wildcard Matching
Ryan Dixon
,
Ö. Eğecioğlu
,
T. Sherwood
International Journal of Foundations of Computer…
2009
Corpus ID: 17071154
Monitoring traffic payloads to detect the occurrence of suspicious patterns has proven to be a useful and necessary tool for…
Expand
2008
2008
State Complexity of NFA to DFA Conversion of Subregular Language Families
Henning Bordihn
,
M. Holzer
,
Martin Kutrib
Workshop on Descriptional Complexity of Formal…
2008
Corpus ID: 6263337
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE