Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-09-12
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Epsilon-moves can be eliminated from NFAs

Statement

For every NFA with epsilon-moves there exists an equivalent NFA with no epsilon-transitions.

Facts & Assumptions

Given: An NFA N=(Q,Σ,δ,q0,F) with epsilon-moves.

[L1]

By The epsilon-closure of a set of NFA states, ECl⁡(q) is the set of states reachable from q by zero or more ε-moves.

[L2]

By Acceptance of a word by an NFA and the recognized language, a word is accepted exactly when the reachable state set after the whole word meets the accepting set.

Proof

technique · cases
1.1L1givenconstruct

Define an epsilon-free NFA N′=(Q,Σ,δ′,q0,F′) by δ′(q,a):=⋃r∈ECl⁡(q)ECl⁡(δ(r,a)) for q∈Q and a∈Σ, and by F′:={q∈Q:ECl⁡(q)∩F≠∅}. Thus one a-move of N′ does exactly what N can do by any number of ε-moves, then one a-move, then any number of ε-moves.

2.1L1step 1.1induction

We claim that for every nonempty word w, the states reachable from q0 in N′ after reading w are exactly the states reachable from q0 in N after reading w. The proof is by induction on ∣w∣: for one letter this is the definition of δ′, and appending one more letter repeats the same closure-before-and-after simulation.

3.1L2step 1.1step 2.1∎

If w=ε, then N accepts w exactly when ECl⁡(q0)∩F≠∅, which is exactly the condition q0∈F′ from step 1.1. If w≠ε, then step 2.1 and [L2] show that N and N′ have the same reachable accepting states after reading w. Hence L(N′)=L(N).

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

5 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources