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 By others on same topic  0 Discussions Create my own version
For w=a0​⋯an−1​, a witnessing sequence from p0​ to pn​ satisfies pi+1​∈Δ(pi​,ai​). Induction on word length shows that q′∈Δ(q,w) exactly when such a sequence runs from q to q′.

 Ancestors (8)

  1. Extended transition of a nondeterministic finite automaton
  2. Nondeterministic finite automaton
  3. Finite-state automaton
  4. Formal language theory
  5. Foundations of mathematics
  6. Area of mathematics
  7. Mathematics
  8.  Home

 View article source

 Discussion (0)

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
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook