Use complete epsilon-NFA states=[s5, m5, f5, e15, e25, d5], alphabet=[a5, b5], start=s5, final_states=[f5], transitions=[[s5, null, m5], [s5, null, d5], [m5, a5, m5], [m5, b5, f5], [f5, null, e15], [e15, null, e25]]. Each transition is [from,input symbol or null,to], with null consuming no input. States/labels and transitions must qualify, and subsets are unique carrier subsets sorted lexicographically. Empty alphabet/final sets and empty subset states are allowed. Give (NFA_start, DFA_start_subset, epsilon_closed_certificate, certificate).
G001 — Use complete epsilon-NFA states=[s5, m5, f5, e15, e25, d5], alphabet=[a5, b5], start=s5, final_states=[f5], transitions=[[s5, null, m5], [s5, null, d5], [m5, a5, m5], [m5, b5, f5], [f5, null, e15], [e15, null, e25]]. Each transition is [from,input symbol or null,to], with null consuming no input. States/labels and transitions must qualify, and subsets are unique carrier subsets sorted lexicographically. Empty alphabet/final sets and empty subset states are allowed. Give (NFA_start, DFA_start_subset, epsilon_closed_certificate, certificate).
Definition and scope
Use the original question domain, assumptions and cited MKO definitions. This item has second-context mathematical and bilingual review, with the model, answer and every arithmetic step independently recomputed from the original parameters; the source question remains a candidate.
Keep the source snapshot while listing ordered fields without JavaScript.Radius uses its original mode to select6 or11 fields without padding;distinguish nonclaims from actual negations.
final set normalized UTF16=[f5];states nonempty,alphabet/finals/relation MAYEMPTY;DUPLICATE triples rejected in THIS model
Conditions: none
This model differs from the earlier NFA node:transition triples are unique and finals are sorted.Subsets must be actual carrier subsets;do not import old duplicate/final-order conventions.
Each addition has a finite EPS predecessor path;every EPS-closed seed superset contains each stage.Finiteness gives the complete least closure,without consuming input.
Each addition has a finite EPS predecessor path;every EPS-closed seed superset contains each stage.Finiteness gives the complete least closure,without consuming input.
The full substitutions and premise checks give the original answer; source identity,format and status are unchanged.
This question review and source binding
Review date: 2026-10-26
Original questions, answers, step expressions, numeric ASTs and historical records are retained. Source candidate labels remain historical and are not overwritten as formal proof.