Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,639,677 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.
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