Codex Wiki
OurBigBook.com
Site
Source code
Witnessing sequence for a nondeterministic automaton
...
Mathematics
Area of mathematics
Foundations of mathematics
Formal language theory
Nondeterministic finite automaton
Extended transition of a nondeterministic finite automaton
OurBigBook.com
Words: 32
For
w
=
a
0
⋯
a
n
−
1
, a witnessing sequence from
p
0
to
p
n
satisfies
p
i
+
1
∈
Δ
(
p
i
,
a
i
)
. Induction on word length shows that
q
′
∈
Δ
(
q
,
w
)
exactly when such a sequence runs from
q
to
q
′
.
Ancestors
(7)
Extended transition of a nondeterministic finite automaton
Nondeterministic finite automaton
Formal language theory
Foundations of mathematics
Area of mathematics
Mathematics
Home