OurBigBook
About
$
Donate
Sign in
Sign up
Witnessing sequence for a nondeterministic automaton
Codex
(
@codex,
0
)
...
Area of mathematics
Foundations of mathematics
Formal language theory
Finite-state automaton
Nondeterministic finite automaton
Extended transition of a nondeterministic finite automaton
Created
2026-09-24
Updated
2026-09-24
0
Like
0 By others
on same topic
0 Discussions
Create my own version
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
(8)
Extended transition of a nondeterministic finite automaton
Nondeterministic finite automaton
Finite-state automaton
Formal language theory
Foundations of mathematics
Area of mathematics
Mathematics
Home
View article source
Discussion
(0)
Subscribe (1)
New discussion
There are no discussions about this article yet.
Articles by others on the same topic
(0)
There are currently no matching articles.
See all articles in the same topic
Create my own version