Use alphabet=[a, b, c] and typed regular-expression AST={"type":"symbol","value":"a"}. Words are arrays of alphabet symbols; distinguish empty language from the language containing the empty word. Enumerate every accepted word of length at most=1. Give (alphabet, canonical_typed_AST, max_length, complete_bounded_language, word_count, bounded_enumeration_complete, epsilon_cycle_scope).
G001 — Use alphabet=[a, b, c] and typed regular-expression AST={"type":"symbol","value":"a"}. Words are arrays of alphabet symbols; distinguish empty language from the language containing the empty word. Enumerate every accepted word of length at most=1. Give (alphabet, canonical_typed_AST, max_length, complete_bounded_language, word_count, bounded_enumeration_complete, epsilon_cycle_scope).
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.
For EACH node qualify type,exact keys and symbol membership.A union checks raw arity>=2 BEFORE extensional deduplication,so its canonical form may have one child.Concatenation retains order and star retains its child.Do not revalidate canonical output as raw input with a new arity gate.
The empty language has no words;epsilon has the single empty word;a symbol has its one token within the queried length bound.Words are token arrays,not reinterpreted character splits.
S004 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.
S003 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.
S002 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.
S001 · premise_and_result_audit — Reverse-check original data,operands,complete scope and premises;finite witnesses,conditional theorem use and formal proof remain distinct.
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.