Codex Wiki
OurBigBook.com
Site
Source code
Powerset construction
Home
Mathematics
Area of mathematics
Foundations of mathematics
Formal language theory
Nondeterministic finite automaton
OurBigBook.com
Words: 31
The powerset construction turns an NFA with state set
Q
into a DFA with state set
P
(
Q
)
, transition
δ
D
(
S
,
a
)
=
⋃
q
∈
S
Δ
(
q
,
a
)
,
(36)
and accepting subsets that meet the NFA final set.
Ancestors
(6)
Nondeterministic finite automaton
Formal language theory
Foundations of mathematics
Area of mathematics
Mathematics
Home
Incoming links
(1)
Solution