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 with epsilon-moves.
By The epsilon-closure of a set of NFA states, is the set of states reachable from by zero or more -moves.
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
Define an epsilon-free NFA by for and , and by Thus one -move of does exactly what can do by any number of -moves, then one -move, then any number of -moves.
We claim that for every nonempty word , the states reachable from in after reading are exactly the states reachable from in after reading . The proof is by induction on : for one letter this is the definition of , and appending one more letter repeats the same closure-before-and-after simulation.
If , then accepts exactly when , which is exactly the condition from step 1.1. If , then step 2.1 and [L2] show that and have the same reachable accepting states after reading . Hence .
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
- Jean Gallier and Jocelyn Quaintance, Introduction to the Theory of Computation: Some Notes for CIS511 (standard reference, not scraped)
- John Watrous, Introduction to the Theory of Computing, Lecture 3: Nondeterministic finite automata (standard reference, not scraped)