Use complete epsilon-NFA states=[s2, m2, f2, e12, e22, d2], alphabet=[a2, b2], start=s2, final_states=[f2], transitions=[[s2, null, m2], [s2, null, d2], [m2, a2, m2], [m2, b2, f2], [f2, null, e12], [e12, null, e22]]. 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. Given subset S=[s2, m2, d2], input symbol=a2. Give (subset, symbol, symbol_targets, epsilon_closed_targets, empty_dead_state, certificate).
G001 — Use complete epsilon-NFA states=[s2, m2, f2, e12, e22, d2], alphabet=[a2, b2], start=s2, final_states=[f2], transitions=[[s2, null, m2], [s2, null, d2], [m2, a2, m2], [m2, b2, f2], [f2, null, e12], [e12, null, e22]]. 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. Given subset S=[s2, m2, d2], input symbol=a2. Give (subset, symbol, symbol_targets, epsilon_closed_targets, empty_dead_state, 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=[f2];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.
Subset DFA ORIGINAL one-symbol transition:EXACT ORIGINAL supplied S=[d2, m2, s2];symbol=a2;ALL matching ORIGINAL edge rows=[[2, m2, m2]]
After
direct symbol targets=[m2];NO EPS preclosure inserted into S;now close ONLY these targets
Conditions: none
An arbitrary supplied S need not be EPS-closed;preclosing it would change this operation.Apply move(S,a) and then close its targets.Empty targets yield the legal empty dead state.
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.
S004 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
S003 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
S002 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
S001 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
Result
([d2, m2, s2], a2, [m2], [m2], No, delta_D_equals_epsilon_closure_after_symbol_move_and_empty_subset_is_a_legal_dead_state)
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.