{"schema_version":"ocme-question-localization-v0.1","question_id":"q-20261015-advance-20261118-r06-regular-expression-0001","batch_id":"batch-20261015-advance-20261118-r06-regular-expression-foundations","locale":"en","translation_state":"ai_candidate","source":{"question_sha256":"54018dd87e7809f3a5e708c3f9cb871bbb65381b67b462da9376612d7b40b000","family_id":"qf-mod49-regex-ast-qualification","seed":202611186001,"semantic_template":"regex-ast-qualification|{alphabet:[\"a\",\"b\",\"c\"],regex:{type:\"symbol\",value:\"a\"}}"},"fields":{"title":"Regular Expressions Have Typed Nodes and an Explicit Alphabet","stem":"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. Give (alphabet, canonical_typed_AST, AST_qualified, qualification_statement).","answer":{"kind":"expression","value":"([a, b, c], {type:\"symbol\",value:\"a\"}, Yes, typed_AST_symbols_in_alphabet)","explanation":"Validate each node type, exact key set, arity and symbol membership. Canonicalize unions extensionally while retaining concatenation order. A shell wildcard is not one of these core regular-expression AST nodes. The exact result, retaining the requested order, is ([a, b, c], {type:\"symbol\",value:\"a\"}, Yes, typed_AST_symbols_in_alphabet)."},"skills":["Regular Expressions Have Typed Nodes and an Explicit Alphabet"],"verification_warning":"This is a candidate exercise. Mechanical recomputation checks only the stated conditions and this instance; it is neither a formal proof nor human review."}}
{"schema_version":"ocme-question-localization-v0.1","question_id":"q-20261015-advance-20261118-r06-regular-expression-0002","batch_id":"batch-20261015-advance-20261118-r06-regular-expression-foundations","locale":"en","translation_state":"ai_candidate","source":{"question_sha256":"fb36082cfa03a8d7692bc53d5ab4d86358ca8bc355ce9fcf32b9541ad74a4897","family_id":"qf-mod49-regex-ast-qualification","seed":202611186002,"semantic_template":"regex-ast-qualification|{alphabet:[\"a\",\"b\",\"c\"],regex:{children:[{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"}],type:\"concat\"}}"},"fields":{"title":"Regular Expressions Have Typed Nodes and an Explicit Alphabet","stem":"Use alphabet=[a, b, c] and typed regular-expression AST={\"type\":\"concat\",\"children\":[{\"type\":\"symbol\",\"value\":\"b\"},{\"type\":\"symbol\",\"value\":\"c\"}]}. Words are arrays of alphabet symbols; distinguish empty language from the language containing the empty word. Give (alphabet, canonical_typed_AST, AST_qualified, qualification_statement).","answer":{"kind":"expression","value":"([a, b, c], {children:[{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"}],type:\"concat\"}, Yes, typed_AST_symbols_in_alphabet)","explanation":"Validate each node type, exact key set, arity and symbol membership. Canonicalize unions extensionally while retaining concatenation order. A shell wildcard is not one of these core regular-expression AST nodes. The exact result, retaining the requested order, is ([a, b, c], {children:[{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"}],type:\"concat\"}, Yes, typed_AST_symbols_in_alphabet)."},"skills":["Regular Expressions Have Typed Nodes and an Explicit Alphabet"],"verification_warning":"This is a candidate exercise. Mechanical recomputation checks only the stated conditions and this instance; it is neither a formal proof nor human review."}}
{"schema_version":"ocme-question-localization-v0.1","question_id":"q-20261015-advance-20261118-r06-regular-expression-0003","batch_id":"batch-20261015-advance-20261118-r06-regular-expression-foundations","locale":"en","translation_state":"ai_candidate","source":{"question_sha256":"cbbdcb72b7fa9cce7cee4816406aaa1cc908bd7c0330a58a0bead543cecb2c6e","family_id":"qf-mod49-regex-ast-qualification","seed":202611186003,"semantic_template":"regex-ast-qualification|{alphabet:[\"a\",\"b\",\"c\"],regex:{children:[{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"}],type:\"concat\"}}"},"fields":{"title":"Regular Expressions Have Typed Nodes and an Explicit Alphabet","stem":"Use alphabet=[a, b, c] and typed regular-expression AST={\"type\":\"concat\",\"children\":[{\"type\":\"symbol\",\"value\":\"c\"},{\"type\":\"symbol\",\"value\":\"a\"},{\"type\":\"symbol\",\"value\":\"b\"}]}. Words are arrays of alphabet symbols; distinguish empty language from the language containing the empty word. Give (alphabet, canonical_typed_AST, AST_qualified, qualification_statement).","answer":{"kind":"expression","value":"([a, b, c], {children:[{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"}],type:\"concat\"}, Yes, typed_AST_symbols_in_alphabet)","explanation":"Validate each node type, exact key set, arity and symbol membership. Canonicalize unions extensionally while retaining concatenation order. A shell wildcard is not one of these core regular-expression AST nodes. The exact result, retaining the requested order, is ([a, b, c], {children:[{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"}],type:\"concat\"}, Yes, typed_AST_symbols_in_alphabet)."},"skills":["Regular Expressions Have Typed Nodes and an Explicit Alphabet"],"verification_warning":"This is a candidate exercise. Mechanical recomputation checks only the stated conditions and this instance; it is neither a formal proof nor human review."}}
{"schema_version":"ocme-question-localization-v0.1","question_id":"q-20261015-advance-20261118-r06-regular-expression-0004","batch_id":"batch-20261015-advance-20261118-r06-regular-expression-foundations","locale":"en","translation_state":"ai_candidate","source":{"question_sha256":"c8448af7702579c4b85ff28d26d1d3de520973b8f90b53bc7f21ad4448373d74","family_id":"qf-mod49-regex-ast-qualification","seed":202611186004,"semantic_template":"regex-ast-qualification|{alphabet:[\"a\",\"b\",\"c\"],regex:{children:[{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"}],type:\"concat\"}}"},"fields":{"title":"Regular Expressions Have Typed Nodes and an Explicit Alphabet","stem":"Use alphabet=[a, b, c] and typed regular-expression AST={\"type\":\"concat\",\"children\":[{\"type\":\"symbol\",\"value\":\"a\"},{\"type\":\"symbol\",\"value\":\"b\"},{\"type\":\"symbol\",\"value\":\"c\"},{\"type\":\"symbol\",\"value\":\"a\"}]}. Words are arrays of alphabet symbols; distinguish empty language from the language containing the empty word. Give (alphabet, canonical_typed_AST, AST_qualified, qualification_statement).","answer":{"kind":"expression","value":"([a, b, c], {children:[{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"}],type:\"concat\"}, Yes, typed_AST_symbols_in_alphabet)","explanation":"Validate each node type, exact key set, arity and symbol membership. Canonicalize unions extensionally while retaining concatenation order. A shell wildcard is not one of these core regular-expression AST nodes. The exact result, retaining the requested order, is ([a, b, c], {children:[{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"}],type:\"concat\"}, Yes, typed_AST_symbols_in_alphabet)."},"skills":["Regular Expressions Have Typed Nodes and an Explicit Alphabet"],"verification_warning":"This is a candidate exercise. Mechanical recomputation checks only the stated conditions and this instance; it is neither a formal proof nor human review."}}
{"schema_version":"ocme-question-localization-v0.1","question_id":"q-20261015-advance-20261118-r06-regular-expression-0005","batch_id":"batch-20261015-advance-20261118-r06-regular-expression-foundations","locale":"en","translation_state":"ai_candidate","source":{"question_sha256":"92348aae760f7fe0163d60c270f4e070eb0359348ed90a6d935993ecc87be2c2","family_id":"qf-mod49-regex-ast-qualification","seed":202611186005,"semantic_template":"regex-ast-qualification|{alphabet:[\"a\",\"b\",\"c\"],regex:{children:[{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"}],type:\"concat\"}}"},"fields":{"title":"Regular Expressions Have Typed Nodes and an Explicit Alphabet","stem":"Use alphabet=[a, b, c] and typed regular-expression AST={\"type\":\"concat\",\"children\":[{\"type\":\"symbol\",\"value\":\"b\"},{\"type\":\"symbol\",\"value\":\"c\"},{\"type\":\"symbol\",\"value\":\"a\"},{\"type\":\"symbol\",\"value\":\"b\"},{\"type\":\"symbol\",\"value\":\"c\"}]}. Words are arrays of alphabet symbols; distinguish empty language from the language containing the empty word. Give (alphabet, canonical_typed_AST, AST_qualified, qualification_statement).","answer":{"kind":"expression","value":"([a, b, c], {children:[{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"}],type:\"concat\"}, Yes, typed_AST_symbols_in_alphabet)","explanation":"Validate each node type, exact key set, arity and symbol membership. Canonicalize unions extensionally while retaining concatenation order. A shell wildcard is not one of these core regular-expression AST nodes. The exact result, retaining the requested order, is ([a, b, c], {children:[{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"}],type:\"concat\"}, Yes, typed_AST_symbols_in_alphabet)."},"skills":["Regular Expressions Have Typed Nodes and an Explicit Alphabet"],"verification_warning":"This is a candidate exercise. Mechanical recomputation checks only the stated conditions and this instance; it is neither a formal proof nor human review."}}
{"schema_version":"ocme-question-localization-v0.1","question_id":"q-20261015-advance-20261118-r06-regular-expression-0006","batch_id":"batch-20261015-advance-20261118-r06-regular-expression-foundations","locale":"en","translation_state":"ai_candidate","source":{"question_sha256":"947813be8fadfc7563b9b2d2f9713699140110dd905e4a9803a2b6c84551aedb","family_id":"qf-mod49-regex-ast-qualification","seed":202611186006,"semantic_template":"regex-ast-qualification|{alphabet:[\"a\",\"b\",\"c\"],regex:{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{type:\"symbol\",value:\"c\"}],type:\"union\"}}"},"fields":{"title":"Regular Expressions Have Typed Nodes and an Explicit Alphabet","stem":"Use alphabet=[a, b, c] and typed regular-expression AST={\"type\":\"union\",\"children\":[{\"type\":\"symbol\",\"value\":\"c\"},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"a\"}}]}. Words are arrays of alphabet symbols; distinguish empty language from the language containing the empty word. Give (alphabet, canonical_typed_AST, AST_qualified, qualification_statement).","answer":{"kind":"expression","value":"([a, b, c], {children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{type:\"symbol\",value:\"c\"}],type:\"union\"}, Yes, typed_AST_symbols_in_alphabet)","explanation":"Validate each node type, exact key set, arity and symbol membership. Canonicalize unions extensionally while retaining concatenation order. A shell wildcard is not one of these core regular-expression AST nodes. The exact result, retaining the requested order, is ([a, b, c], {children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{type:\"symbol\",value:\"c\"}],type:\"union\"}, Yes, typed_AST_symbols_in_alphabet)."},"skills":["Regular Expressions Have Typed Nodes and an Explicit Alphabet"],"verification_warning":"This is a candidate exercise. Mechanical recomputation checks only the stated conditions and this instance; it is neither a formal proof nor human review."}}
{"schema_version":"ocme-question-localization-v0.1","question_id":"q-20261015-advance-20261118-r06-regular-expression-0007","batch_id":"batch-20261015-advance-20261118-r06-regular-expression-foundations","locale":"en","translation_state":"ai_candidate","source":{"question_sha256":"125951a6bc331f7fd6ad9c4afdb9e154787133473a5c2677953a7dab175f68f4","family_id":"qf-mod49-regex-ast-qualification","seed":202611186007,"semantic_template":"regex-ast-qualification|{alphabet:[\"a\",\"b\",\"c\"],regex:{children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"}],type:\"concat\"}],type:\"union\"}}"},"fields":{"title":"Regular Expressions Have Typed Nodes and an Explicit Alphabet","stem":"Use alphabet=[a, b, c] and typed regular-expression AST={\"type\":\"union\",\"children\":[{\"type\":\"concat\",\"children\":[{\"type\":\"symbol\",\"value\":\"a\"},{\"type\":\"symbol\",\"value\":\"b\"}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"b\"}}]}. Words are arrays of alphabet symbols; distinguish empty language from the language containing the empty word. Give (alphabet, canonical_typed_AST, AST_qualified, qualification_statement).","answer":{"kind":"expression","value":"([a, b, c], {children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"}],type:\"concat\"}],type:\"union\"}, Yes, typed_AST_symbols_in_alphabet)","explanation":"Validate each node type, exact key set, arity and symbol membership. Canonicalize unions extensionally while retaining concatenation order. A shell wildcard is not one of these core regular-expression AST nodes. The exact result, retaining the requested order, is ([a, b, c], {children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"}],type:\"concat\"}],type:\"union\"}, Yes, typed_AST_symbols_in_alphabet)."},"skills":["Regular Expressions Have Typed Nodes and an Explicit Alphabet"],"verification_warning":"This is a candidate exercise. Mechanical recomputation checks only the stated conditions and this instance; it is neither a formal proof nor human review."}}
{"schema_version":"ocme-question-localization-v0.1","question_id":"q-20261015-advance-20261118-r06-regular-expression-0008","batch_id":"batch-20261015-advance-20261118-r06-regular-expression-foundations","locale":"en","translation_state":"ai_candidate","source":{"question_sha256":"5ac315d0a10be57c936b79830cac659c03ee94362cc9fa847867fd64c80cc2b5","family_id":"qf-mod49-regex-ast-qualification","seed":202611186008,"semantic_template":"regex-ast-qualification|{alphabet:[\"a\",\"b\",\"c\"],regex:{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"}],type:\"concat\"}],type:\"union\"}}"},"fields":{"title":"Regular Expressions Have Typed Nodes and an Explicit Alphabet","stem":"Use alphabet=[a, b, c] and typed regular-expression AST={\"type\":\"union\",\"children\":[{\"type\":\"concat\",\"children\":[{\"type\":\"symbol\",\"value\":\"b\"},{\"type\":\"symbol\",\"value\":\"c\"},{\"type\":\"symbol\",\"value\":\"a\"}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"c\"}}]}. Words are arrays of alphabet symbols; distinguish empty language from the language containing the empty word. Give (alphabet, canonical_typed_AST, AST_qualified, qualification_statement).","answer":{"kind":"expression","value":"([a, b, c], {children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"}],type:\"concat\"}],type:\"union\"}, Yes, typed_AST_symbols_in_alphabet)","explanation":"Validate each node type, exact key set, arity and symbol membership. Canonicalize unions extensionally while retaining concatenation order. A shell wildcard is not one of these core regular-expression AST nodes. The exact result, retaining the requested order, is ([a, b, c], {children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"}],type:\"concat\"}],type:\"union\"}, Yes, typed_AST_symbols_in_alphabet)."},"skills":["Regular Expressions Have Typed Nodes and an Explicit Alphabet"],"verification_warning":"This is a candidate exercise. Mechanical recomputation checks only the stated conditions and this instance; it is neither a formal proof nor human review."}}
{"schema_version":"ocme-question-localization-v0.1","question_id":"q-20261015-advance-20261118-r06-regular-expression-0009","batch_id":"batch-20261015-advance-20261118-r06-regular-expression-foundations","locale":"en","translation_state":"ai_candidate","source":{"question_sha256":"630e6ef1866bfd95e42d579bc65c39b26742c547b6589c7e92d45dcce55156da","family_id":"qf-mod49-regex-ast-qualification","seed":202611186009,"semantic_template":"regex-ast-qualification|{alphabet:[\"a\",\"b\",\"c\"],regex:{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"}],type:\"concat\"}],type:\"union\"}}"},"fields":{"title":"Regular Expressions Have Typed Nodes and an Explicit Alphabet","stem":"Use alphabet=[a, b, c] and typed regular-expression AST={\"type\":\"union\",\"children\":[{\"type\":\"concat\",\"children\":[{\"type\":\"symbol\",\"value\":\"c\"},{\"type\":\"symbol\",\"value\":\"a\"},{\"type\":\"symbol\",\"value\":\"b\"},{\"type\":\"symbol\",\"value\":\"c\"}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"a\"}}]}. Words are arrays of alphabet symbols; distinguish empty language from the language containing the empty word. Give (alphabet, canonical_typed_AST, AST_qualified, qualification_statement).","answer":{"kind":"expression","value":"([a, b, c], {children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"}],type:\"concat\"}],type:\"union\"}, Yes, typed_AST_symbols_in_alphabet)","explanation":"Validate each node type, exact key set, arity and symbol membership. Canonicalize unions extensionally while retaining concatenation order. A shell wildcard is not one of these core regular-expression AST nodes. The exact result, retaining the requested order, is ([a, b, c], {children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"}],type:\"concat\"}],type:\"union\"}, Yes, typed_AST_symbols_in_alphabet)."},"skills":["Regular Expressions Have Typed Nodes and an Explicit Alphabet"],"verification_warning":"This is a candidate exercise. Mechanical recomputation checks only the stated conditions and this instance; it is neither a formal proof nor human review."}}
{"schema_version":"ocme-question-localization-v0.1","question_id":"q-20261015-advance-20261118-r06-regular-expression-0010","batch_id":"batch-20261015-advance-20261118-r06-regular-expression-foundations","locale":"en","translation_state":"ai_candidate","source":{"question_sha256":"8d28d5212070555413150dc648fbdbb2f901d11a28cc34ae00694169608110d9","family_id":"qf-mod49-regex-ast-qualification","seed":202611186010,"semantic_template":"regex-ast-qualification|{alphabet:[\"a\",\"b\",\"c\"],regex:{children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"}],type:\"concat\"}],type:\"union\"}}"},"fields":{"title":"Regular Expressions Have Typed Nodes and an Explicit Alphabet","stem":"Use alphabet=[a, b, c] and typed regular-expression AST={\"type\":\"union\",\"children\":[{\"type\":\"concat\",\"children\":[{\"type\":\"symbol\",\"value\":\"a\"},{\"type\":\"symbol\",\"value\":\"b\"},{\"type\":\"symbol\",\"value\":\"c\"},{\"type\":\"symbol\",\"value\":\"a\"},{\"type\":\"symbol\",\"value\":\"b\"}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"b\"}}]}. Words are arrays of alphabet symbols; distinguish empty language from the language containing the empty word. Give (alphabet, canonical_typed_AST, AST_qualified, qualification_statement).","answer":{"kind":"expression","value":"([a, b, c], {children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"}],type:\"concat\"}],type:\"union\"}, Yes, typed_AST_symbols_in_alphabet)","explanation":"Validate each node type, exact key set, arity and symbol membership. Canonicalize unions extensionally while retaining concatenation order. A shell wildcard is not one of these core regular-expression AST nodes. The exact result, retaining the requested order, is ([a, b, c], {children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"}],type:\"concat\"}],type:\"union\"}, Yes, typed_AST_symbols_in_alphabet)."},"skills":["Regular Expressions Have Typed Nodes and an Explicit Alphabet"],"verification_warning":"This is a candidate exercise. Mechanical recomputation checks only the stated conditions and this instance; it is neither a formal proof nor human review."}}
{"schema_version":"ocme-question-localization-v0.1","question_id":"q-20261015-advance-20261118-r06-regular-expression-0011","batch_id":"batch-20261015-advance-20261118-r06-regular-expression-foundations","locale":"en","translation_state":"ai_candidate","source":{"question_sha256":"d73edcade49e1fceef0eb94bb2a680faa4362b266a159c8c0f32ef62d277a145","family_id":"qf-mod49-regex-ast-qualification","seed":202611186011,"semantic_template":"regex-ast-qualification|{alphabet:[\"a\",\"b\",\"c\"],regex:{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{type:\"symbol\",value:\"b\"}],type:\"union\"}],type:\"union\"}}"},"fields":{"title":"Regular Expressions Have Typed Nodes and an Explicit Alphabet","stem":"Use alphabet=[a, b, c] and typed regular-expression AST={\"type\":\"union\",\"children\":[{\"type\":\"union\",\"children\":[{\"type\":\"symbol\",\"value\":\"b\"},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"c\"}}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"a\"}}]}. Words are arrays of alphabet symbols; distinguish empty language from the language containing the empty word. Give (alphabet, canonical_typed_AST, AST_qualified, qualification_statement).","answer":{"kind":"expression","value":"([a, b, c], {children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{type:\"symbol\",value:\"b\"}],type:\"union\"}],type:\"union\"}, Yes, typed_AST_symbols_in_alphabet)","explanation":"Validate each node type, exact key set, arity and symbol membership. Canonicalize unions extensionally while retaining concatenation order. A shell wildcard is not one of these core regular-expression AST nodes. The exact result, retaining the requested order, is ([a, b, c], {children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{type:\"symbol\",value:\"b\"}],type:\"union\"}],type:\"union\"}, Yes, typed_AST_symbols_in_alphabet)."},"skills":["Regular Expressions Have Typed Nodes and an Explicit Alphabet"],"verification_warning":"This is a candidate exercise. Mechanical recomputation checks only the stated conditions and this instance; it is neither a formal proof nor human review."}}
{"schema_version":"ocme-question-localization-v0.1","question_id":"q-20261015-advance-20261118-r06-regular-expression-0012","batch_id":"batch-20261015-advance-20261118-r06-regular-expression-foundations","locale":"en","translation_state":"ai_candidate","source":{"question_sha256":"60b5aedefd04fda9428ecc0539ac51d4a1eb7be692c3aa93ec413c2dd26b6e81","family_id":"qf-mod49-regex-ast-qualification","seed":202611186012,"semantic_template":"regex-ast-qualification|{alphabet:[\"a\",\"b\",\"c\"],regex:{children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"}}"},"fields":{"title":"Regular Expressions Have Typed Nodes and an Explicit Alphabet","stem":"Use alphabet=[a, b, c] and typed regular-expression AST={\"type\":\"union\",\"children\":[{\"type\":\"union\",\"children\":[{\"type\":\"concat\",\"children\":[{\"type\":\"symbol\",\"value\":\"c\"},{\"type\":\"symbol\",\"value\":\"a\"}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"a\"}}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"b\"}}]}. Words are arrays of alphabet symbols; distinguish empty language from the language containing the empty word. Give (alphabet, canonical_typed_AST, AST_qualified, qualification_statement).","answer":{"kind":"expression","value":"([a, b, c], {children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"}, Yes, typed_AST_symbols_in_alphabet)","explanation":"Validate each node type, exact key set, arity and symbol membership. Canonicalize unions extensionally while retaining concatenation order. A shell wildcard is not one of these core regular-expression AST nodes. The exact result, retaining the requested order, is ([a, b, c], {children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"}, Yes, typed_AST_symbols_in_alphabet)."},"skills":["Regular Expressions Have Typed Nodes and an Explicit Alphabet"],"verification_warning":"This is a candidate exercise. Mechanical recomputation checks only the stated conditions and this instance; it is neither a formal proof nor human review."}}
{"schema_version":"ocme-question-localization-v0.1","question_id":"q-20261015-advance-20261118-r06-regular-expression-0013","batch_id":"batch-20261015-advance-20261118-r06-regular-expression-foundations","locale":"en","translation_state":"ai_candidate","source":{"question_sha256":"bea3ba0b89013ef76e05d7ef0236fd2214fbe54b493f7001086eab69ae6a9522","family_id":"qf-mod49-regex-ast-qualification","seed":202611186013,"semantic_template":"regex-ast-qualification|{alphabet:[\"a\",\"b\",\"c\"],regex:{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"}}"},"fields":{"title":"Regular Expressions Have Typed Nodes and an Explicit Alphabet","stem":"Use alphabet=[a, b, c] and typed regular-expression AST={\"type\":\"union\",\"children\":[{\"type\":\"union\",\"children\":[{\"type\":\"concat\",\"children\":[{\"type\":\"symbol\",\"value\":\"a\"},{\"type\":\"symbol\",\"value\":\"b\"},{\"type\":\"symbol\",\"value\":\"c\"}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"b\"}}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"c\"}}]}. Words are arrays of alphabet symbols; distinguish empty language from the language containing the empty word. Give (alphabet, canonical_typed_AST, AST_qualified, qualification_statement).","answer":{"kind":"expression","value":"([a, b, c], {children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"}, Yes, typed_AST_symbols_in_alphabet)","explanation":"Validate each node type, exact key set, arity and symbol membership. Canonicalize unions extensionally while retaining concatenation order. A shell wildcard is not one of these core regular-expression AST nodes. The exact result, retaining the requested order, is ([a, b, c], {children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"}, Yes, typed_AST_symbols_in_alphabet)."},"skills":["Regular Expressions Have Typed Nodes and an Explicit Alphabet"],"verification_warning":"This is a candidate exercise. Mechanical recomputation checks only the stated conditions and this instance; it is neither a formal proof nor human review."}}
{"schema_version":"ocme-question-localization-v0.1","question_id":"q-20261015-advance-20261118-r06-regular-expression-0014","batch_id":"batch-20261015-advance-20261118-r06-regular-expression-foundations","locale":"en","translation_state":"ai_candidate","source":{"question_sha256":"5911c32351f77b143f0ff7185752df50b19d1f002bf26b2a8ae9b74b15774914","family_id":"qf-mod49-regex-ast-qualification","seed":202611186014,"semantic_template":"regex-ast-qualification|{alphabet:[\"a\",\"b\",\"c\"],regex:{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"}}"},"fields":{"title":"Regular Expressions Have Typed Nodes and an Explicit Alphabet","stem":"Use alphabet=[a, b, c] and typed regular-expression AST={\"type\":\"union\",\"children\":[{\"type\":\"union\",\"children\":[{\"type\":\"concat\",\"children\":[{\"type\":\"symbol\",\"value\":\"b\"},{\"type\":\"symbol\",\"value\":\"c\"},{\"type\":\"symbol\",\"value\":\"a\"},{\"type\":\"symbol\",\"value\":\"b\"}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"c\"}}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"a\"}}]}. Words are arrays of alphabet symbols; distinguish empty language from the language containing the empty word. Give (alphabet, canonical_typed_AST, AST_qualified, qualification_statement).","answer":{"kind":"expression","value":"([a, b, c], {children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"}, Yes, typed_AST_symbols_in_alphabet)","explanation":"Validate each node type, exact key set, arity and symbol membership. Canonicalize unions extensionally while retaining concatenation order. A shell wildcard is not one of these core regular-expression AST nodes. The exact result, retaining the requested order, is ([a, b, c], {children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"}, Yes, typed_AST_symbols_in_alphabet)."},"skills":["Regular Expressions Have Typed Nodes and an Explicit Alphabet"],"verification_warning":"This is a candidate exercise. Mechanical recomputation checks only the stated conditions and this instance; it is neither a formal proof nor human review."}}
{"schema_version":"ocme-question-localization-v0.1","question_id":"q-20261015-advance-20261118-r06-regular-expression-0015","batch_id":"batch-20261015-advance-20261118-r06-regular-expression-foundations","locale":"en","translation_state":"ai_candidate","source":{"question_sha256":"76db4644ecb29588d9e2ac9a7dae13d76fa0cacbf8cc8fc321637d9d5a9c0999","family_id":"qf-mod49-regex-ast-qualification","seed":202611186015,"semantic_template":"regex-ast-qualification|{alphabet:[\"a\",\"b\",\"c\"],regex:{children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"}}"},"fields":{"title":"Regular Expressions Have Typed Nodes and an Explicit Alphabet","stem":"Use alphabet=[a, b, c] and typed regular-expression AST={\"type\":\"union\",\"children\":[{\"type\":\"union\",\"children\":[{\"type\":\"concat\",\"children\":[{\"type\":\"symbol\",\"value\":\"c\"},{\"type\":\"symbol\",\"value\":\"a\"},{\"type\":\"symbol\",\"value\":\"b\"},{\"type\":\"symbol\",\"value\":\"c\"},{\"type\":\"symbol\",\"value\":\"a\"}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"a\"}}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"b\"}}]}. Words are arrays of alphabet symbols; distinguish empty language from the language containing the empty word. Give (alphabet, canonical_typed_AST, AST_qualified, qualification_statement).","answer":{"kind":"expression","value":"([a, b, c], {children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"}, Yes, typed_AST_symbols_in_alphabet)","explanation":"Validate each node type, exact key set, arity and symbol membership. Canonicalize unions extensionally while retaining concatenation order. A shell wildcard is not one of these core regular-expression AST nodes. The exact result, retaining the requested order, is ([a, b, c], {children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"}, Yes, typed_AST_symbols_in_alphabet)."},"skills":["Regular Expressions Have Typed Nodes and an Explicit Alphabet"],"verification_warning":"This is a candidate exercise. Mechanical recomputation checks only the stated conditions and this instance; it is neither a formal proof nor human review."}}
{"schema_version":"ocme-question-localization-v0.1","question_id":"q-20261015-advance-20261118-r06-regular-expression-0016","batch_id":"batch-20261015-advance-20261118-r06-regular-expression-foundations","locale":"en","translation_state":"ai_candidate","source":{"question_sha256":"8a1ab236196a89712aba5b599bf58dd2c2b15736016d2c266b571c7dc9a44471","family_id":"qf-mod49-regex-ast-qualification","seed":202611186016,"semantic_template":"regex-ast-qualification|{alphabet:[\"a\",\"b\",\"c\"],regex:{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{type:\"symbol\",value:\"a\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}}"},"fields":{"title":"Regular Expressions Have Typed Nodes and an Explicit Alphabet","stem":"Use alphabet=[a, b, c] and typed regular-expression AST={\"type\":\"union\",\"children\":[{\"type\":\"union\",\"children\":[{\"type\":\"union\",\"children\":[{\"type\":\"symbol\",\"value\":\"a\"},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"b\"}}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"c\"}}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"a\"}}]}. Words are arrays of alphabet symbols; distinguish empty language from the language containing the empty word. Give (alphabet, canonical_typed_AST, AST_qualified, qualification_statement).","answer":{"kind":"expression","value":"([a, b, c], {children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{type:\"symbol\",value:\"a\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}, Yes, typed_AST_symbols_in_alphabet)","explanation":"Validate each node type, exact key set, arity and symbol membership. Canonicalize unions extensionally while retaining concatenation order. A shell wildcard is not one of these core regular-expression AST nodes. The exact result, retaining the requested order, is ([a, b, c], {children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{type:\"symbol\",value:\"a\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}, Yes, typed_AST_symbols_in_alphabet)."},"skills":["Regular Expressions Have Typed Nodes and an Explicit Alphabet"],"verification_warning":"This is a candidate exercise. Mechanical recomputation checks only the stated conditions and this instance; it is neither a formal proof nor human review."}}
{"schema_version":"ocme-question-localization-v0.1","question_id":"q-20261015-advance-20261118-r06-regular-expression-0017","batch_id":"batch-20261015-advance-20261118-r06-regular-expression-foundations","locale":"en","translation_state":"ai_candidate","source":{"question_sha256":"f3cf681babc157d07b0ea4e9eacd60f37d8f17ecc68e338ecb1b3c7601fbb274","family_id":"qf-mod49-regex-ast-qualification","seed":202611186017,"semantic_template":"regex-ast-qualification|{alphabet:[\"a\",\"b\",\"c\"],regex:{children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}}"},"fields":{"title":"Regular Expressions Have Typed Nodes and an Explicit Alphabet","stem":"Use alphabet=[a, b, c] and typed regular-expression AST={\"type\":\"union\",\"children\":[{\"type\":\"union\",\"children\":[{\"type\":\"union\",\"children\":[{\"type\":\"concat\",\"children\":[{\"type\":\"symbol\",\"value\":\"b\"},{\"type\":\"symbol\",\"value\":\"c\"}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"c\"}}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"a\"}}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"b\"}}]}. Words are arrays of alphabet symbols; distinguish empty language from the language containing the empty word. Give (alphabet, canonical_typed_AST, AST_qualified, qualification_statement).","answer":{"kind":"expression","value":"([a, b, c], {children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}, Yes, typed_AST_symbols_in_alphabet)","explanation":"Validate each node type, exact key set, arity and symbol membership. Canonicalize unions extensionally while retaining concatenation order. A shell wildcard is not one of these core regular-expression AST nodes. The exact result, retaining the requested order, is ([a, b, c], {children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}, Yes, typed_AST_symbols_in_alphabet)."},"skills":["Regular Expressions Have Typed Nodes and an Explicit Alphabet"],"verification_warning":"This is a candidate exercise. Mechanical recomputation checks only the stated conditions and this instance; it is neither a formal proof nor human review."}}
{"schema_version":"ocme-question-localization-v0.1","question_id":"q-20261015-advance-20261118-r06-regular-expression-0018","batch_id":"batch-20261015-advance-20261118-r06-regular-expression-foundations","locale":"en","translation_state":"ai_candidate","source":{"question_sha256":"10b317c84ca62b9fd52bb3b95b699a3d47d42ba8e19eb5a4ed4a2123fc15449e","family_id":"qf-mod49-regex-ast-qualification","seed":202611186018,"semantic_template":"regex-ast-qualification|{alphabet:[\"a\",\"b\",\"c\"],regex:{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}}"},"fields":{"title":"Regular Expressions Have Typed Nodes and an Explicit Alphabet","stem":"Use alphabet=[a, b, c] and typed regular-expression AST={\"type\":\"union\",\"children\":[{\"type\":\"union\",\"children\":[{\"type\":\"union\",\"children\":[{\"type\":\"concat\",\"children\":[{\"type\":\"symbol\",\"value\":\"c\"},{\"type\":\"symbol\",\"value\":\"a\"},{\"type\":\"symbol\",\"value\":\"b\"}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"a\"}}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"b\"}}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"c\"}}]}. Words are arrays of alphabet symbols; distinguish empty language from the language containing the empty word. Give (alphabet, canonical_typed_AST, AST_qualified, qualification_statement).","answer":{"kind":"expression","value":"([a, b, c], {children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}, Yes, typed_AST_symbols_in_alphabet)","explanation":"Validate each node type, exact key set, arity and symbol membership. Canonicalize unions extensionally while retaining concatenation order. A shell wildcard is not one of these core regular-expression AST nodes. The exact result, retaining the requested order, is ([a, b, c], {children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}, Yes, typed_AST_symbols_in_alphabet)."},"skills":["Regular Expressions Have Typed Nodes and an Explicit Alphabet"],"verification_warning":"This is a candidate exercise. Mechanical recomputation checks only the stated conditions and this instance; it is neither a formal proof nor human review."}}
{"schema_version":"ocme-question-localization-v0.1","question_id":"q-20261015-advance-20261118-r06-regular-expression-0019","batch_id":"batch-20261015-advance-20261118-r06-regular-expression-foundations","locale":"en","translation_state":"ai_candidate","source":{"question_sha256":"da352c5ef487e5cc6bf067d95aca55af2784dc307eca8c0ec1073d585c8f120d","family_id":"qf-mod49-regex-ast-qualification","seed":202611186019,"semantic_template":"regex-ast-qualification|{alphabet:[\"a\",\"b\",\"c\"],regex:{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}}"},"fields":{"title":"Regular Expressions Have Typed Nodes and an Explicit Alphabet","stem":"Use alphabet=[a, b, c] and typed regular-expression AST={\"type\":\"union\",\"children\":[{\"type\":\"union\",\"children\":[{\"type\":\"union\",\"children\":[{\"type\":\"concat\",\"children\":[{\"type\":\"symbol\",\"value\":\"a\"},{\"type\":\"symbol\",\"value\":\"b\"},{\"type\":\"symbol\",\"value\":\"c\"},{\"type\":\"symbol\",\"value\":\"a\"}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"b\"}}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"c\"}}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"a\"}}]}. Words are arrays of alphabet symbols; distinguish empty language from the language containing the empty word. Give (alphabet, canonical_typed_AST, AST_qualified, qualification_statement).","answer":{"kind":"expression","value":"([a, b, c], {children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}, Yes, typed_AST_symbols_in_alphabet)","explanation":"Validate each node type, exact key set, arity and symbol membership. Canonicalize unions extensionally while retaining concatenation order. A shell wildcard is not one of these core regular-expression AST nodes. The exact result, retaining the requested order, is ([a, b, c], {children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}, Yes, typed_AST_symbols_in_alphabet)."},"skills":["Regular Expressions Have Typed Nodes and an Explicit Alphabet"],"verification_warning":"This is a candidate exercise. Mechanical recomputation checks only the stated conditions and this instance; it is neither a formal proof nor human review."}}
{"schema_version":"ocme-question-localization-v0.1","question_id":"q-20261015-advance-20261118-r06-regular-expression-0020","batch_id":"batch-20261015-advance-20261118-r06-regular-expression-foundations","locale":"en","translation_state":"ai_candidate","source":{"question_sha256":"67c06d1e6958576ef2ffe79d15d81c99813a6afc617ae83491e2b2d10cadf129","family_id":"qf-mod49-regex-ast-qualification","seed":202611186020,"semantic_template":"regex-ast-qualification|{alphabet:[\"a\",\"b\",\"c\"],regex:{children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}}"},"fields":{"title":"Regular Expressions Have Typed Nodes and an Explicit Alphabet","stem":"Use alphabet=[a, b, c] and typed regular-expression AST={\"type\":\"union\",\"children\":[{\"type\":\"union\",\"children\":[{\"type\":\"union\",\"children\":[{\"type\":\"concat\",\"children\":[{\"type\":\"symbol\",\"value\":\"b\"},{\"type\":\"symbol\",\"value\":\"c\"},{\"type\":\"symbol\",\"value\":\"a\"},{\"type\":\"symbol\",\"value\":\"b\"},{\"type\":\"symbol\",\"value\":\"c\"}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"c\"}}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"a\"}}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"b\"}}]}. Words are arrays of alphabet symbols; distinguish empty language from the language containing the empty word. Give (alphabet, canonical_typed_AST, AST_qualified, qualification_statement).","answer":{"kind":"expression","value":"([a, b, c], {children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}, Yes, typed_AST_symbols_in_alphabet)","explanation":"Validate each node type, exact key set, arity and symbol membership. Canonicalize unions extensionally while retaining concatenation order. A shell wildcard is not one of these core regular-expression AST nodes. The exact result, retaining the requested order, is ([a, b, c], {children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}, Yes, typed_AST_symbols_in_alphabet)."},"skills":["Regular Expressions Have Typed Nodes and an Explicit Alphabet"],"verification_warning":"This is a candidate exercise. Mechanical recomputation checks only the stated conditions and this instance; it is neither a formal proof nor human review."}}
{"schema_version":"ocme-question-localization-v0.1","question_id":"q-20261015-advance-20261118-r06-regular-expression-0021","batch_id":"batch-20261015-advance-20261118-r06-regular-expression-foundations","locale":"en","translation_state":"ai_candidate","source":{"question_sha256":"c9ca25372b4d09aef423401bb511f8bd247e68d89f53856b2ba691e26dc6911e","family_id":"qf-mod49-regex-ast-qualification","seed":202611186021,"semantic_template":"regex-ast-qualification|{alphabet:[\"a\",\"b\",\"c\"],regex:{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{type:\"symbol\",value:\"c\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}}"},"fields":{"title":"Regular Expressions Have Typed Nodes and an Explicit Alphabet","stem":"Use alphabet=[a, b, c] and typed regular-expression AST={\"type\":\"union\",\"children\":[{\"type\":\"union\",\"children\":[{\"type\":\"union\",\"children\":[{\"type\":\"union\",\"children\":[{\"type\":\"symbol\",\"value\":\"c\"},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"a\"}}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"b\"}}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"c\"}}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"a\"}}]}. Words are arrays of alphabet symbols; distinguish empty language from the language containing the empty word. Give (alphabet, canonical_typed_AST, AST_qualified, qualification_statement).","answer":{"kind":"expression","value":"([a, b, c], {children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{type:\"symbol\",value:\"c\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}, Yes, typed_AST_symbols_in_alphabet)","explanation":"Validate each node type, exact key set, arity and symbol membership. Canonicalize unions extensionally while retaining concatenation order. A shell wildcard is not one of these core regular-expression AST nodes. The exact result, retaining the requested order, is ([a, b, c], {children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{type:\"symbol\",value:\"c\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}, Yes, typed_AST_symbols_in_alphabet)."},"skills":["Regular Expressions Have Typed Nodes and an Explicit Alphabet"],"verification_warning":"This is a candidate exercise. Mechanical recomputation checks only the stated conditions and this instance; it is neither a formal proof nor human review."}}
{"schema_version":"ocme-question-localization-v0.1","question_id":"q-20261015-advance-20261118-r06-regular-expression-0022","batch_id":"batch-20261015-advance-20261118-r06-regular-expression-foundations","locale":"en","translation_state":"ai_candidate","source":{"question_sha256":"9f823ea04add13a77b34909fd3cfaf3e393322ae49689dd9077680dd4071575e","family_id":"qf-mod49-regex-ast-qualification","seed":202611186022,"semantic_template":"regex-ast-qualification|{alphabet:[\"a\",\"b\",\"c\"],regex:{children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}}"},"fields":{"title":"Regular Expressions Have Typed Nodes and an Explicit Alphabet","stem":"Use alphabet=[a, b, c] and typed regular-expression AST={\"type\":\"union\",\"children\":[{\"type\":\"union\",\"children\":[{\"type\":\"union\",\"children\":[{\"type\":\"union\",\"children\":[{\"type\":\"concat\",\"children\":[{\"type\":\"symbol\",\"value\":\"a\"},{\"type\":\"symbol\",\"value\":\"b\"}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"b\"}}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"c\"}}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"a\"}}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"b\"}}]}. Words are arrays of alphabet symbols; distinguish empty language from the language containing the empty word. Give (alphabet, canonical_typed_AST, AST_qualified, qualification_statement).","answer":{"kind":"expression","value":"([a, b, c], {children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}, Yes, typed_AST_symbols_in_alphabet)","explanation":"Validate each node type, exact key set, arity and symbol membership. Canonicalize unions extensionally while retaining concatenation order. A shell wildcard is not one of these core regular-expression AST nodes. The exact result, retaining the requested order, is ([a, b, c], {children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}, Yes, typed_AST_symbols_in_alphabet)."},"skills":["Regular Expressions Have Typed Nodes and an Explicit Alphabet"],"verification_warning":"This is a candidate exercise. Mechanical recomputation checks only the stated conditions and this instance; it is neither a formal proof nor human review."}}
{"schema_version":"ocme-question-localization-v0.1","question_id":"q-20261015-advance-20261118-r06-regular-expression-0023","batch_id":"batch-20261015-advance-20261118-r06-regular-expression-foundations","locale":"en","translation_state":"ai_candidate","source":{"question_sha256":"d9d1f59799544766189c449826cddc6a4131d0d4f746553183e445aeab5df3e4","family_id":"qf-mod49-regex-ast-qualification","seed":202611186023,"semantic_template":"regex-ast-qualification|{alphabet:[\"a\",\"b\",\"c\"],regex:{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}}"},"fields":{"title":"Regular Expressions Have Typed Nodes and an Explicit Alphabet","stem":"Use alphabet=[a, b, c] and typed regular-expression AST={\"type\":\"union\",\"children\":[{\"type\":\"union\",\"children\":[{\"type\":\"union\",\"children\":[{\"type\":\"union\",\"children\":[{\"type\":\"concat\",\"children\":[{\"type\":\"symbol\",\"value\":\"b\"},{\"type\":\"symbol\",\"value\":\"c\"},{\"type\":\"symbol\",\"value\":\"a\"}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"c\"}}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"a\"}}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"b\"}}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"c\"}}]}. Words are arrays of alphabet symbols; distinguish empty language from the language containing the empty word. Give (alphabet, canonical_typed_AST, AST_qualified, qualification_statement).","answer":{"kind":"expression","value":"([a, b, c], {children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}, Yes, typed_AST_symbols_in_alphabet)","explanation":"Validate each node type, exact key set, arity and symbol membership. Canonicalize unions extensionally while retaining concatenation order. A shell wildcard is not one of these core regular-expression AST nodes. The exact result, retaining the requested order, is ([a, b, c], {children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}, Yes, typed_AST_symbols_in_alphabet)."},"skills":["Regular Expressions Have Typed Nodes and an Explicit Alphabet"],"verification_warning":"This is a candidate exercise. Mechanical recomputation checks only the stated conditions and this instance; it is neither a formal proof nor human review."}}
{"schema_version":"ocme-question-localization-v0.1","question_id":"q-20261015-advance-20261118-r06-regular-expression-0024","batch_id":"batch-20261015-advance-20261118-r06-regular-expression-foundations","locale":"en","translation_state":"ai_candidate","source":{"question_sha256":"fe5c5b213bd2d8fce5f9249109af681133a86e38783611b74f9295315c42961e","family_id":"qf-mod49-regex-ast-qualification","seed":202611186024,"semantic_template":"regex-ast-qualification|{alphabet:[\"a\",\"b\",\"c\"],regex:{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}}"},"fields":{"title":"Regular Expressions Have Typed Nodes and an Explicit Alphabet","stem":"Use alphabet=[a, b, c] and typed regular-expression AST={\"type\":\"union\",\"children\":[{\"type\":\"union\",\"children\":[{\"type\":\"union\",\"children\":[{\"type\":\"union\",\"children\":[{\"type\":\"concat\",\"children\":[{\"type\":\"symbol\",\"value\":\"c\"},{\"type\":\"symbol\",\"value\":\"a\"},{\"type\":\"symbol\",\"value\":\"b\"},{\"type\":\"symbol\",\"value\":\"c\"}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"a\"}}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"b\"}}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"c\"}}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"a\"}}]}. Words are arrays of alphabet symbols; distinguish empty language from the language containing the empty word. Give (alphabet, canonical_typed_AST, AST_qualified, qualification_statement).","answer":{"kind":"expression","value":"([a, b, c], {children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}, Yes, typed_AST_symbols_in_alphabet)","explanation":"Validate each node type, exact key set, arity and symbol membership. Canonicalize unions extensionally while retaining concatenation order. A shell wildcard is not one of these core regular-expression AST nodes. The exact result, retaining the requested order, is ([a, b, c], {children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}, Yes, typed_AST_symbols_in_alphabet)."},"skills":["Regular Expressions Have Typed Nodes and an Explicit Alphabet"],"verification_warning":"This is a candidate exercise. Mechanical recomputation checks only the stated conditions and this instance; it is neither a formal proof nor human review."}}
{"schema_version":"ocme-question-localization-v0.1","question_id":"q-20261015-advance-20261118-r06-regular-expression-0025","batch_id":"batch-20261015-advance-20261118-r06-regular-expression-foundations","locale":"en","translation_state":"ai_candidate","source":{"question_sha256":"f57e6a837d7bc6a2cbe06d7ba3fedaf522f7455311ff6af9f0b7d9a225beaa0f","family_id":"qf-mod49-regex-ast-qualification","seed":202611186025,"semantic_template":"regex-ast-qualification|{alphabet:[\"a\",\"b\",\"c\"],regex:{children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}}"},"fields":{"title":"Regular Expressions Have Typed Nodes and an Explicit Alphabet","stem":"Use alphabet=[a, b, c] and typed regular-expression AST={\"type\":\"union\",\"children\":[{\"type\":\"union\",\"children\":[{\"type\":\"union\",\"children\":[{\"type\":\"union\",\"children\":[{\"type\":\"concat\",\"children\":[{\"type\":\"symbol\",\"value\":\"a\"},{\"type\":\"symbol\",\"value\":\"b\"},{\"type\":\"symbol\",\"value\":\"c\"},{\"type\":\"symbol\",\"value\":\"a\"},{\"type\":\"symbol\",\"value\":\"b\"}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"b\"}}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"c\"}}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"a\"}}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"b\"}}]}. Words are arrays of alphabet symbols; distinguish empty language from the language containing the empty word. Give (alphabet, canonical_typed_AST, AST_qualified, qualification_statement).","answer":{"kind":"expression","value":"([a, b, c], {children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}, Yes, typed_AST_symbols_in_alphabet)","explanation":"Validate each node type, exact key set, arity and symbol membership. Canonicalize unions extensionally while retaining concatenation order. A shell wildcard is not one of these core regular-expression AST nodes. The exact result, retaining the requested order, is ([a, b, c], {children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}, Yes, typed_AST_symbols_in_alphabet)."},"skills":["Regular Expressions Have Typed Nodes and an Explicit Alphabet"],"verification_warning":"This is a candidate exercise. Mechanical recomputation checks only the stated conditions and this instance; it is neither a formal proof nor human review."}}
{"schema_version":"ocme-question-localization-v0.1","question_id":"q-20261015-advance-20261118-r06-regular-expression-0026","batch_id":"batch-20261015-advance-20261118-r06-regular-expression-foundations","locale":"en","translation_state":"ai_candidate","source":{"question_sha256":"487830ef99ff84a544881df26b9e5091d34a6485a63636c0e8a3a0afe3e5bf5b","family_id":"qf-mod49-regex-bounded-language","seed":202611186026,"semantic_template":"regex-bounded-language|{alphabet:[\"a\",\"b\",\"c\"],max_length:1,regex:{type:\"symbol\",value:\"a\"}}"},"fields":{"title":"The Complete Bounded Language Includes Epsilon and Terminates Epsilon Cycles","stem":"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).","answer":{"kind":"expression","value":"([a, b, c], {type:\"symbol\",value:\"a\"}, 1, [[a]], 1, Yes, epsilon_cycles_terminate_by_extensional_dedup)","explanation":"Retain all words in length/canonical order and the exact count. Star closure includes the empty word and uses extensional deduplication to terminate epsilon cycles. Completeness is only through the declared bound; it does not establish equivalence of the full unbounded languages. The exact result, retaining the requested order, is ([a, b, c], {type:\"symbol\",value:\"a\"}, 1, [[a]], 1, Yes, epsilon_cycles_terminate_by_extensional_dedup)."},"skills":["The Complete Bounded Language Includes Epsilon and Terminates Epsilon Cycles"],"verification_warning":"This is a candidate exercise. Mechanical recomputation checks only the stated conditions and this instance; it is neither a formal proof nor human review."}}
{"schema_version":"ocme-question-localization-v0.1","question_id":"q-20261015-advance-20261118-r06-regular-expression-0027","batch_id":"batch-20261015-advance-20261118-r06-regular-expression-foundations","locale":"en","translation_state":"ai_candidate","source":{"question_sha256":"fe6fb26528800b5c0b873803389d62243e4760bbda4d47403011829d97408818","family_id":"qf-mod49-regex-bounded-language","seed":202611186027,"semantic_template":"regex-bounded-language|{alphabet:[\"a\",\"b\",\"c\"],max_length:2,regex:{children:[{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"}],type:\"concat\"}}"},"fields":{"title":"The Complete Bounded Language Includes Epsilon and Terminates Epsilon Cycles","stem":"Use alphabet=[a, b, c] and typed regular-expression AST={\"type\":\"concat\",\"children\":[{\"type\":\"symbol\",\"value\":\"b\"},{\"type\":\"symbol\",\"value\":\"c\"}]}. Words are arrays of alphabet symbols; distinguish empty language from the language containing the empty word. Enumerate every accepted word of length at most=2. Give (alphabet, canonical_typed_AST, max_length, complete_bounded_language, word_count, bounded_enumeration_complete, epsilon_cycle_scope).","answer":{"kind":"expression","value":"([a, b, c], {children:[{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"}],type:\"concat\"}, 2, [[b, c]], 1, Yes, epsilon_cycles_terminate_by_extensional_dedup)","explanation":"Retain all words in length/canonical order and the exact count. Star closure includes the empty word and uses extensional deduplication to terminate epsilon cycles. Completeness is only through the declared bound; it does not establish equivalence of the full unbounded languages. The exact result, retaining the requested order, is ([a, b, c], {children:[{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"}],type:\"concat\"}, 2, [[b, c]], 1, Yes, epsilon_cycles_terminate_by_extensional_dedup)."},"skills":["The Complete Bounded Language Includes Epsilon and Terminates Epsilon Cycles"],"verification_warning":"This is a candidate exercise. Mechanical recomputation checks only the stated conditions and this instance; it is neither a formal proof nor human review."}}
{"schema_version":"ocme-question-localization-v0.1","question_id":"q-20261015-advance-20261118-r06-regular-expression-0028","batch_id":"batch-20261015-advance-20261118-r06-regular-expression-foundations","locale":"en","translation_state":"ai_candidate","source":{"question_sha256":"db5f88c8aac721fe620bd98f1eec2df8ef730c491274c799d21c4a6b90b6b51b","family_id":"qf-mod49-regex-bounded-language","seed":202611186028,"semantic_template":"regex-bounded-language|{alphabet:[\"a\",\"b\",\"c\"],max_length:3,regex:{children:[{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"}],type:\"concat\"}}"},"fields":{"title":"The Complete Bounded Language Includes Epsilon and Terminates Epsilon Cycles","stem":"Use alphabet=[a, b, c] and typed regular-expression AST={\"type\":\"concat\",\"children\":[{\"type\":\"symbol\",\"value\":\"c\"},{\"type\":\"symbol\",\"value\":\"a\"},{\"type\":\"symbol\",\"value\":\"b\"}]}. Words are arrays of alphabet symbols; distinguish empty language from the language containing the empty word. Enumerate every accepted word of length at most=3. Give (alphabet, canonical_typed_AST, max_length, complete_bounded_language, word_count, bounded_enumeration_complete, epsilon_cycle_scope).","answer":{"kind":"expression","value":"([a, b, c], {children:[{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"}],type:\"concat\"}, 3, [[c, a, b]], 1, Yes, epsilon_cycles_terminate_by_extensional_dedup)","explanation":"Retain all words in length/canonical order and the exact count. Star closure includes the empty word and uses extensional deduplication to terminate epsilon cycles. Completeness is only through the declared bound; it does not establish equivalence of the full unbounded languages. The exact result, retaining the requested order, is ([a, b, c], {children:[{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"}],type:\"concat\"}, 3, [[c, a, b]], 1, Yes, epsilon_cycles_terminate_by_extensional_dedup)."},"skills":["The Complete Bounded Language Includes Epsilon and Terminates Epsilon Cycles"],"verification_warning":"This is a candidate exercise. Mechanical recomputation checks only the stated conditions and this instance; it is neither a formal proof nor human review."}}
{"schema_version":"ocme-question-localization-v0.1","question_id":"q-20261015-advance-20261118-r06-regular-expression-0029","batch_id":"batch-20261015-advance-20261118-r06-regular-expression-foundations","locale":"en","translation_state":"ai_candidate","source":{"question_sha256":"7e36b0bbb8aaabeac5a1cd894f48fc47d6e4b0cda0eb46590ae0cc0cd875f5bd","family_id":"qf-mod49-regex-bounded-language","seed":202611186029,"semantic_template":"regex-bounded-language|{alphabet:[\"a\",\"b\",\"c\"],max_length:4,regex:{children:[{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"}],type:\"concat\"}}"},"fields":{"title":"The Complete Bounded Language Includes Epsilon and Terminates Epsilon Cycles","stem":"Use alphabet=[a, b, c] and typed regular-expression AST={\"type\":\"concat\",\"children\":[{\"type\":\"symbol\",\"value\":\"a\"},{\"type\":\"symbol\",\"value\":\"b\"},{\"type\":\"symbol\",\"value\":\"c\"},{\"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=4. Give (alphabet, canonical_typed_AST, max_length, complete_bounded_language, word_count, bounded_enumeration_complete, epsilon_cycle_scope).","answer":{"kind":"expression","value":"([a, b, c], {children:[{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"}],type:\"concat\"}, 4, [[a, b, c, a]], 1, Yes, epsilon_cycles_terminate_by_extensional_dedup)","explanation":"Retain all words in length/canonical order and the exact count. Star closure includes the empty word and uses extensional deduplication to terminate epsilon cycles. Completeness is only through the declared bound; it does not establish equivalence of the full unbounded languages. The exact result, retaining the requested order, is ([a, b, c], {children:[{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"}],type:\"concat\"}, 4, [[a, b, c, a]], 1, Yes, epsilon_cycles_terminate_by_extensional_dedup)."},"skills":["The Complete Bounded Language Includes Epsilon and Terminates Epsilon Cycles"],"verification_warning":"This is a candidate exercise. Mechanical recomputation checks only the stated conditions and this instance; it is neither a formal proof nor human review."}}
{"schema_version":"ocme-question-localization-v0.1","question_id":"q-20261015-advance-20261118-r06-regular-expression-0030","batch_id":"batch-20261015-advance-20261118-r06-regular-expression-foundations","locale":"en","translation_state":"ai_candidate","source":{"question_sha256":"e5aabead466ce4e444523d9bb8a18f1ae44257c90bdc65899ab5bcade104fac2","family_id":"qf-mod49-regex-bounded-language","seed":202611186030,"semantic_template":"regex-bounded-language|{alphabet:[\"a\",\"b\",\"c\"],max_length:5,regex:{children:[{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"}],type:\"concat\"}}"},"fields":{"title":"The Complete Bounded Language Includes Epsilon and Terminates Epsilon Cycles","stem":"Use alphabet=[a, b, c] and typed regular-expression AST={\"type\":\"concat\",\"children\":[{\"type\":\"symbol\",\"value\":\"b\"},{\"type\":\"symbol\",\"value\":\"c\"},{\"type\":\"symbol\",\"value\":\"a\"},{\"type\":\"symbol\",\"value\":\"b\"},{\"type\":\"symbol\",\"value\":\"c\"}]}. Words are arrays of alphabet symbols; distinguish empty language from the language containing the empty word. Enumerate every accepted word of length at most=5. Give (alphabet, canonical_typed_AST, max_length, complete_bounded_language, word_count, bounded_enumeration_complete, epsilon_cycle_scope).","answer":{"kind":"expression","value":"([a, b, c], {children:[{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"}],type:\"concat\"}, 5, [[b, c, a, b, c]], 1, Yes, epsilon_cycles_terminate_by_extensional_dedup)","explanation":"Retain all words in length/canonical order and the exact count. Star closure includes the empty word and uses extensional deduplication to terminate epsilon cycles. Completeness is only through the declared bound; it does not establish equivalence of the full unbounded languages. The exact result, retaining the requested order, is ([a, b, c], {children:[{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"}],type:\"concat\"}, 5, [[b, c, a, b, c]], 1, Yes, epsilon_cycles_terminate_by_extensional_dedup)."},"skills":["The Complete Bounded Language Includes Epsilon and Terminates Epsilon Cycles"],"verification_warning":"This is a candidate exercise. Mechanical recomputation checks only the stated conditions and this instance; it is neither a formal proof nor human review."}}
{"schema_version":"ocme-question-localization-v0.1","question_id":"q-20261015-advance-20261118-r06-regular-expression-0031","batch_id":"batch-20261015-advance-20261118-r06-regular-expression-foundations","locale":"en","translation_state":"ai_candidate","source":{"question_sha256":"0abf685685ee751a6a6429cfe130c9a2765c2197f9bb375d1cc1632c62b4a086","family_id":"qf-mod49-regex-bounded-language","seed":202611186031,"semantic_template":"regex-bounded-language|{alphabet:[\"a\",\"b\",\"c\"],max_length:1,regex:{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{type:\"symbol\",value:\"c\"}],type:\"union\"}}"},"fields":{"title":"The Complete Bounded Language Includes Epsilon and Terminates Epsilon Cycles","stem":"Use alphabet=[a, b, c] and typed regular-expression AST={\"type\":\"union\",\"children\":[{\"type\":\"symbol\",\"value\":\"c\"},{\"type\":\"star\",\"child\":{\"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).","answer":{"kind":"expression","value":"([a, b, c], {children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{type:\"symbol\",value:\"c\"}],type:\"union\"}, 1, [[], [a], [c]], 3, Yes, epsilon_cycles_terminate_by_extensional_dedup)","explanation":"Retain all words in length/canonical order and the exact count. Star closure includes the empty word and uses extensional deduplication to terminate epsilon cycles. Completeness is only through the declared bound; it does not establish equivalence of the full unbounded languages. The exact result, retaining the requested order, is ([a, b, c], {children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{type:\"symbol\",value:\"c\"}],type:\"union\"}, 1, [[], [a], [c]], 3, Yes, epsilon_cycles_terminate_by_extensional_dedup)."},"skills":["The Complete Bounded Language Includes Epsilon and Terminates Epsilon Cycles"],"verification_warning":"This is a candidate exercise. Mechanical recomputation checks only the stated conditions and this instance; it is neither a formal proof nor human review."}}
{"schema_version":"ocme-question-localization-v0.1","question_id":"q-20261015-advance-20261118-r06-regular-expression-0032","batch_id":"batch-20261015-advance-20261118-r06-regular-expression-foundations","locale":"en","translation_state":"ai_candidate","source":{"question_sha256":"854805399e3dc34ef8ce71f04f927767c2f57beca9621bb23af99813109ad8ec","family_id":"qf-mod49-regex-bounded-language","seed":202611186032,"semantic_template":"regex-bounded-language|{alphabet:[\"a\",\"b\",\"c\"],max_length:2,regex:{children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"}],type:\"concat\"}],type:\"union\"}}"},"fields":{"title":"The Complete Bounded Language Includes Epsilon and Terminates Epsilon Cycles","stem":"Use alphabet=[a, b, c] and typed regular-expression AST={\"type\":\"union\",\"children\":[{\"type\":\"concat\",\"children\":[{\"type\":\"symbol\",\"value\":\"a\"},{\"type\":\"symbol\",\"value\":\"b\"}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"b\"}}]}. Words are arrays of alphabet symbols; distinguish empty language from the language containing the empty word. Enumerate every accepted word of length at most=2. Give (alphabet, canonical_typed_AST, max_length, complete_bounded_language, word_count, bounded_enumeration_complete, epsilon_cycle_scope).","answer":{"kind":"expression","value":"([a, b, c], {children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"}],type:\"concat\"}],type:\"union\"}, 2, [[], [b], [a, b], [b, b]], 4, Yes, epsilon_cycles_terminate_by_extensional_dedup)","explanation":"Retain all words in length/canonical order and the exact count. Star closure includes the empty word and uses extensional deduplication to terminate epsilon cycles. Completeness is only through the declared bound; it does not establish equivalence of the full unbounded languages. The exact result, retaining the requested order, is ([a, b, c], {children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"}],type:\"concat\"}],type:\"union\"}, 2, [[], [b], [a, b], [b, b]], 4, Yes, epsilon_cycles_terminate_by_extensional_dedup)."},"skills":["The Complete Bounded Language Includes Epsilon and Terminates Epsilon Cycles"],"verification_warning":"This is a candidate exercise. Mechanical recomputation checks only the stated conditions and this instance; it is neither a formal proof nor human review."}}
{"schema_version":"ocme-question-localization-v0.1","question_id":"q-20261015-advance-20261118-r06-regular-expression-0033","batch_id":"batch-20261015-advance-20261118-r06-regular-expression-foundations","locale":"en","translation_state":"ai_candidate","source":{"question_sha256":"fd93b41173b048fa2665e0b8111d1f0042824d9d6ff57b0f7f361a720882691b","family_id":"qf-mod49-regex-bounded-language","seed":202611186033,"semantic_template":"regex-bounded-language|{alphabet:[\"a\",\"b\",\"c\"],max_length:3,regex:{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"}],type:\"concat\"}],type:\"union\"}}"},"fields":{"title":"The Complete Bounded Language Includes Epsilon and Terminates Epsilon Cycles","stem":"Use alphabet=[a, b, c] and typed regular-expression AST={\"type\":\"union\",\"children\":[{\"type\":\"concat\",\"children\":[{\"type\":\"symbol\",\"value\":\"b\"},{\"type\":\"symbol\",\"value\":\"c\"},{\"type\":\"symbol\",\"value\":\"a\"}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"c\"}}]}. Words are arrays of alphabet symbols; distinguish empty language from the language containing the empty word. Enumerate every accepted word of length at most=3. Give (alphabet, canonical_typed_AST, max_length, complete_bounded_language, word_count, bounded_enumeration_complete, epsilon_cycle_scope).","answer":{"kind":"expression","value":"([a, b, c], {children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"}],type:\"concat\"}],type:\"union\"}, 3, [[], [c], [c, c], [b, c, a], [c, c, c]], 5, Yes, epsilon_cycles_terminate_by_extensional_dedup)","explanation":"Retain all words in length/canonical order and the exact count. Star closure includes the empty word and uses extensional deduplication to terminate epsilon cycles. Completeness is only through the declared bound; it does not establish equivalence of the full unbounded languages. The exact result, retaining the requested order, is ([a, b, c], {children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"}],type:\"concat\"}],type:\"union\"}, 3, [[], [c], [c, c], [b, c, a], [c, c, c]], 5, Yes, epsilon_cycles_terminate_by_extensional_dedup)."},"skills":["The Complete Bounded Language Includes Epsilon and Terminates Epsilon Cycles"],"verification_warning":"This is a candidate exercise. Mechanical recomputation checks only the stated conditions and this instance; it is neither a formal proof nor human review."}}
{"schema_version":"ocme-question-localization-v0.1","question_id":"q-20261015-advance-20261118-r06-regular-expression-0034","batch_id":"batch-20261015-advance-20261118-r06-regular-expression-foundations","locale":"en","translation_state":"ai_candidate","source":{"question_sha256":"a60c96d36d7b1370435ab81532561e71191c1c10cadbfa0529af162f69c4e13d","family_id":"qf-mod49-regex-bounded-language","seed":202611186034,"semantic_template":"regex-bounded-language|{alphabet:[\"a\",\"b\",\"c\"],max_length:4,regex:{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"}],type:\"concat\"}],type:\"union\"}}"},"fields":{"title":"The Complete Bounded Language Includes Epsilon and Terminates Epsilon Cycles","stem":"Use alphabet=[a, b, c] and typed regular-expression AST={\"type\":\"union\",\"children\":[{\"type\":\"concat\",\"children\":[{\"type\":\"symbol\",\"value\":\"c\"},{\"type\":\"symbol\",\"value\":\"a\"},{\"type\":\"symbol\",\"value\":\"b\"},{\"type\":\"symbol\",\"value\":\"c\"}]},{\"type\":\"star\",\"child\":{\"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=4. Give (alphabet, canonical_typed_AST, max_length, complete_bounded_language, word_count, bounded_enumeration_complete, epsilon_cycle_scope).","answer":{"kind":"expression","value":"([a, b, c], {children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"}],type:\"concat\"}],type:\"union\"}, 4, [[], [a], [a, a], [a, a, a], [a, a, a, a], [c, a, b, c]], 6, Yes, epsilon_cycles_terminate_by_extensional_dedup)","explanation":"Retain all words in length/canonical order and the exact count. Star closure includes the empty word and uses extensional deduplication to terminate epsilon cycles. Completeness is only through the declared bound; it does not establish equivalence of the full unbounded languages. The exact result, retaining the requested order, is ([a, b, c], {children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"}],type:\"concat\"}],type:\"union\"}, 4, [[], [a], [a, a], [a, a, a], [a, a, a, a], [c, a, b, c]], 6, Yes, epsilon_cycles_terminate_by_extensional_dedup)."},"skills":["The Complete Bounded Language Includes Epsilon and Terminates Epsilon Cycles"],"verification_warning":"This is a candidate exercise. Mechanical recomputation checks only the stated conditions and this instance; it is neither a formal proof nor human review."}}
{"schema_version":"ocme-question-localization-v0.1","question_id":"q-20261015-advance-20261118-r06-regular-expression-0035","batch_id":"batch-20261015-advance-20261118-r06-regular-expression-foundations","locale":"en","translation_state":"ai_candidate","source":{"question_sha256":"09b0b9aafb3bf210cdea3501feb6b809fa86fa97c63e43b87118943325d2e908","family_id":"qf-mod49-regex-bounded-language","seed":202611186035,"semantic_template":"regex-bounded-language|{alphabet:[\"a\",\"b\",\"c\"],max_length:5,regex:{children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"}],type:\"concat\"}],type:\"union\"}}"},"fields":{"title":"The Complete Bounded Language Includes Epsilon and Terminates Epsilon Cycles","stem":"Use alphabet=[a, b, c] and typed regular-expression AST={\"type\":\"union\",\"children\":[{\"type\":\"concat\",\"children\":[{\"type\":\"symbol\",\"value\":\"a\"},{\"type\":\"symbol\",\"value\":\"b\"},{\"type\":\"symbol\",\"value\":\"c\"},{\"type\":\"symbol\",\"value\":\"a\"},{\"type\":\"symbol\",\"value\":\"b\"}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"b\"}}]}. Words are arrays of alphabet symbols; distinguish empty language from the language containing the empty word. Enumerate every accepted word of length at most=5. Give (alphabet, canonical_typed_AST, max_length, complete_bounded_language, word_count, bounded_enumeration_complete, epsilon_cycle_scope).","answer":{"kind":"expression","value":"([a, b, c], {children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"}],type:\"concat\"}],type:\"union\"}, 5, [[], [b], [b, b], [b, b, b], [b, b, b, b], [a, b, c, a, b], [b, b, b, b, b]], 7, Yes, epsilon_cycles_terminate_by_extensional_dedup)","explanation":"Retain all words in length/canonical order and the exact count. Star closure includes the empty word and uses extensional deduplication to terminate epsilon cycles. Completeness is only through the declared bound; it does not establish equivalence of the full unbounded languages. The exact result, retaining the requested order, is ([a, b, c], {children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"}],type:\"concat\"}],type:\"union\"}, 5, [[], [b], [b, b], [b, b, b], [b, b, b, b], [a, b, c, a, b], [b, b, b, b, b]], 7, Yes, epsilon_cycles_terminate_by_extensional_dedup)."},"skills":["The Complete Bounded Language Includes Epsilon and Terminates Epsilon Cycles"],"verification_warning":"This is a candidate exercise. Mechanical recomputation checks only the stated conditions and this instance; it is neither a formal proof nor human review."}}
{"schema_version":"ocme-question-localization-v0.1","question_id":"q-20261015-advance-20261118-r06-regular-expression-0036","batch_id":"batch-20261015-advance-20261118-r06-regular-expression-foundations","locale":"en","translation_state":"ai_candidate","source":{"question_sha256":"f72cd88dc96583c62a5a75df44f6b4e00b0a31d21f158ed384306d6c742d4080","family_id":"qf-mod49-regex-bounded-language","seed":202611186036,"semantic_template":"regex-bounded-language|{alphabet:[\"a\",\"b\",\"c\"],max_length:1,regex:{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{type:\"symbol\",value:\"b\"}],type:\"union\"}],type:\"union\"}}"},"fields":{"title":"The Complete Bounded Language Includes Epsilon and Terminates Epsilon Cycles","stem":"Use alphabet=[a, b, c] and typed regular-expression AST={\"type\":\"union\",\"children\":[{\"type\":\"union\",\"children\":[{\"type\":\"symbol\",\"value\":\"b\"},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"c\"}}]},{\"type\":\"star\",\"child\":{\"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).","answer":{"kind":"expression","value":"([a, b, c], {children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{type:\"symbol\",value:\"b\"}],type:\"union\"}],type:\"union\"}, 1, [[], [a], [b], [c]], 4, Yes, epsilon_cycles_terminate_by_extensional_dedup)","explanation":"Retain all words in length/canonical order and the exact count. Star closure includes the empty word and uses extensional deduplication to terminate epsilon cycles. Completeness is only through the declared bound; it does not establish equivalence of the full unbounded languages. The exact result, retaining the requested order, is ([a, b, c], {children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{type:\"symbol\",value:\"b\"}],type:\"union\"}],type:\"union\"}, 1, [[], [a], [b], [c]], 4, Yes, epsilon_cycles_terminate_by_extensional_dedup)."},"skills":["The Complete Bounded Language Includes Epsilon and Terminates Epsilon Cycles"],"verification_warning":"This is a candidate exercise. Mechanical recomputation checks only the stated conditions and this instance; it is neither a formal proof nor human review."}}
{"schema_version":"ocme-question-localization-v0.1","question_id":"q-20261015-advance-20261118-r06-regular-expression-0037","batch_id":"batch-20261015-advance-20261118-r06-regular-expression-foundations","locale":"en","translation_state":"ai_candidate","source":{"question_sha256":"132e5614a03f4ce66788ad2613a5eb0dc2c019ed1a054fe1aeb766c6ec891792","family_id":"qf-mod49-regex-bounded-language","seed":202611186037,"semantic_template":"regex-bounded-language|{alphabet:[\"a\",\"b\",\"c\"],max_length:2,regex:{children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"}}"},"fields":{"title":"The Complete Bounded Language Includes Epsilon and Terminates Epsilon Cycles","stem":"Use alphabet=[a, b, c] and typed regular-expression AST={\"type\":\"union\",\"children\":[{\"type\":\"union\",\"children\":[{\"type\":\"concat\",\"children\":[{\"type\":\"symbol\",\"value\":\"c\"},{\"type\":\"symbol\",\"value\":\"a\"}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"a\"}}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"b\"}}]}. Words are arrays of alphabet symbols; distinguish empty language from the language containing the empty word. Enumerate every accepted word of length at most=2. Give (alphabet, canonical_typed_AST, max_length, complete_bounded_language, word_count, bounded_enumeration_complete, epsilon_cycle_scope).","answer":{"kind":"expression","value":"([a, b, c], {children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"}, 2, [[], [a], [b], [a, a], [b, b], [c, a]], 6, Yes, epsilon_cycles_terminate_by_extensional_dedup)","explanation":"Retain all words in length/canonical order and the exact count. Star closure includes the empty word and uses extensional deduplication to terminate epsilon cycles. Completeness is only through the declared bound; it does not establish equivalence of the full unbounded languages. The exact result, retaining the requested order, is ([a, b, c], {children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"}, 2, [[], [a], [b], [a, a], [b, b], [c, a]], 6, Yes, epsilon_cycles_terminate_by_extensional_dedup)."},"skills":["The Complete Bounded Language Includes Epsilon and Terminates Epsilon Cycles"],"verification_warning":"This is a candidate exercise. Mechanical recomputation checks only the stated conditions and this instance; it is neither a formal proof nor human review."}}
{"schema_version":"ocme-question-localization-v0.1","question_id":"q-20261015-advance-20261118-r06-regular-expression-0038","batch_id":"batch-20261015-advance-20261118-r06-regular-expression-foundations","locale":"en","translation_state":"ai_candidate","source":{"question_sha256":"e244073f1359ded0ce99b50a6a46fac317be2d0d81372d76bbec97d385577840","family_id":"qf-mod49-regex-bounded-language","seed":202611186038,"semantic_template":"regex-bounded-language|{alphabet:[\"a\",\"b\",\"c\"],max_length:3,regex:{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"}}"},"fields":{"title":"The Complete Bounded Language Includes Epsilon and Terminates Epsilon Cycles","stem":"Use alphabet=[a, b, c] and typed regular-expression AST={\"type\":\"union\",\"children\":[{\"type\":\"union\",\"children\":[{\"type\":\"concat\",\"children\":[{\"type\":\"symbol\",\"value\":\"a\"},{\"type\":\"symbol\",\"value\":\"b\"},{\"type\":\"symbol\",\"value\":\"c\"}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"b\"}}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"c\"}}]}. Words are arrays of alphabet symbols; distinguish empty language from the language containing the empty word. Enumerate every accepted word of length at most=3. Give (alphabet, canonical_typed_AST, max_length, complete_bounded_language, word_count, bounded_enumeration_complete, epsilon_cycle_scope).","answer":{"kind":"expression","value":"([a, b, c], {children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"}, 3, [[], [b], [c], [b, b], [c, c], [a, b, c], [b, b, b], [c, c, c]], 8, Yes, epsilon_cycles_terminate_by_extensional_dedup)","explanation":"Retain all words in length/canonical order and the exact count. Star closure includes the empty word and uses extensional deduplication to terminate epsilon cycles. Completeness is only through the declared bound; it does not establish equivalence of the full unbounded languages. The exact result, retaining the requested order, is ([a, b, c], {children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"}, 3, [[], [b], [c], [b, b], [c, c], [a, b, c], [b, b, b], [c, c, c]], 8, Yes, epsilon_cycles_terminate_by_extensional_dedup)."},"skills":["The Complete Bounded Language Includes Epsilon and Terminates Epsilon Cycles"],"verification_warning":"This is a candidate exercise. Mechanical recomputation checks only the stated conditions and this instance; it is neither a formal proof nor human review."}}
{"schema_version":"ocme-question-localization-v0.1","question_id":"q-20261015-advance-20261118-r06-regular-expression-0039","batch_id":"batch-20261015-advance-20261118-r06-regular-expression-foundations","locale":"en","translation_state":"ai_candidate","source":{"question_sha256":"a6de47dd0ed8a74f5376d47df5d6df63bdae453e85d6bdfa1b5db27bdb296b01","family_id":"qf-mod49-regex-bounded-language","seed":202611186039,"semantic_template":"regex-bounded-language|{alphabet:[\"a\",\"b\",\"c\"],max_length:4,regex:{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"}}"},"fields":{"title":"The Complete Bounded Language Includes Epsilon and Terminates Epsilon Cycles","stem":"Use alphabet=[a, b, c] and typed regular-expression AST={\"type\":\"union\",\"children\":[{\"type\":\"union\",\"children\":[{\"type\":\"concat\",\"children\":[{\"type\":\"symbol\",\"value\":\"b\"},{\"type\":\"symbol\",\"value\":\"c\"},{\"type\":\"symbol\",\"value\":\"a\"},{\"type\":\"symbol\",\"value\":\"b\"}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"c\"}}]},{\"type\":\"star\",\"child\":{\"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=4. Give (alphabet, canonical_typed_AST, max_length, complete_bounded_language, word_count, bounded_enumeration_complete, epsilon_cycle_scope).","answer":{"kind":"expression","value":"([a, b, c], {children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"}, 4, [[], [a], [c], [a, a], [c, c], [a, a, a], [c, c, c], [a, a, a, a], [b, c, a, b], [c, c, c, c]], 10, Yes, epsilon_cycles_terminate_by_extensional_dedup)","explanation":"Retain all words in length/canonical order and the exact count. Star closure includes the empty word and uses extensional deduplication to terminate epsilon cycles. Completeness is only through the declared bound; it does not establish equivalence of the full unbounded languages. The exact result, retaining the requested order, is ([a, b, c], {children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"}, 4, [[], [a], [c], [a, a], [c, c], [a, a, a], [c, c, c], [a, a, a, a], [b, c, a, b], [c, c, c, c]], 10, Yes, epsilon_cycles_terminate_by_extensional_dedup)."},"skills":["The Complete Bounded Language Includes Epsilon and Terminates Epsilon Cycles"],"verification_warning":"This is a candidate exercise. Mechanical recomputation checks only the stated conditions and this instance; it is neither a formal proof nor human review."}}
{"schema_version":"ocme-question-localization-v0.1","question_id":"q-20261015-advance-20261118-r06-regular-expression-0040","batch_id":"batch-20261015-advance-20261118-r06-regular-expression-foundations","locale":"en","translation_state":"ai_candidate","source":{"question_sha256":"becc3bef73291c3682496429ab2c745a887a4067f64266422bb285fcba44c79c","family_id":"qf-mod49-regex-bounded-language","seed":202611186040,"semantic_template":"regex-bounded-language|{alphabet:[\"a\",\"b\",\"c\"],max_length:5,regex:{children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"}}"},"fields":{"title":"The Complete Bounded Language Includes Epsilon and Terminates Epsilon Cycles","stem":"Use alphabet=[a, b, c] and typed regular-expression AST={\"type\":\"union\",\"children\":[{\"type\":\"union\",\"children\":[{\"type\":\"concat\",\"children\":[{\"type\":\"symbol\",\"value\":\"c\"},{\"type\":\"symbol\",\"value\":\"a\"},{\"type\":\"symbol\",\"value\":\"b\"},{\"type\":\"symbol\",\"value\":\"c\"},{\"type\":\"symbol\",\"value\":\"a\"}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"a\"}}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"b\"}}]}. Words are arrays of alphabet symbols; distinguish empty language from the language containing the empty word. Enumerate every accepted word of length at most=5. Give (alphabet, canonical_typed_AST, max_length, complete_bounded_language, word_count, bounded_enumeration_complete, epsilon_cycle_scope).","answer":{"kind":"expression","value":"([a, b, c], {children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"}, 5, [[], [a], [b], [a, a], [b, b], [a, a, a], [b, b, b], [a, a, a, a], [b, b, b, b], [a, a, a, a, a], [b, b, b, b, b], [c, a, b, c, a]], 12, Yes, epsilon_cycles_terminate_by_extensional_dedup)","explanation":"Retain all words in length/canonical order and the exact count. Star closure includes the empty word and uses extensional deduplication to terminate epsilon cycles. Completeness is only through the declared bound; it does not establish equivalence of the full unbounded languages. The exact result, retaining the requested order, is ([a, b, c], {children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"}, 5, [[], [a], [b], [a, a], [b, b], [a, a, a], [b, b, b], [a, a, a, a], [b, b, b, b], [a, a, a, a, a], [b, b, b, b, b], [c, a, b, c, a]], 12, Yes, epsilon_cycles_terminate_by_extensional_dedup)."},"skills":["The Complete Bounded Language Includes Epsilon and Terminates Epsilon Cycles"],"verification_warning":"This is a candidate exercise. Mechanical recomputation checks only the stated conditions and this instance; it is neither a formal proof nor human review."}}
{"schema_version":"ocme-question-localization-v0.1","question_id":"q-20261015-advance-20261118-r06-regular-expression-0041","batch_id":"batch-20261015-advance-20261118-r06-regular-expression-foundations","locale":"en","translation_state":"ai_candidate","source":{"question_sha256":"8e189a29aac2b2e6bfac38c4ec980cf1403eb6144400fd55c21a2eafdd245fb3","family_id":"qf-mod49-regex-bounded-language","seed":202611186041,"semantic_template":"regex-bounded-language|{alphabet:[\"a\",\"b\",\"c\"],max_length:1,regex:{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{type:\"symbol\",value:\"a\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}}"},"fields":{"title":"The Complete Bounded Language Includes Epsilon and Terminates Epsilon Cycles","stem":"Use alphabet=[a, b, c] and typed regular-expression AST={\"type\":\"union\",\"children\":[{\"type\":\"union\",\"children\":[{\"type\":\"union\",\"children\":[{\"type\":\"symbol\",\"value\":\"a\"},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"b\"}}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"c\"}}]},{\"type\":\"star\",\"child\":{\"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).","answer":{"kind":"expression","value":"([a, b, c], {children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{type:\"symbol\",value:\"a\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}, 1, [[], [a], [b], [c]], 4, Yes, epsilon_cycles_terminate_by_extensional_dedup)","explanation":"Retain all words in length/canonical order and the exact count. Star closure includes the empty word and uses extensional deduplication to terminate epsilon cycles. Completeness is only through the declared bound; it does not establish equivalence of the full unbounded languages. The exact result, retaining the requested order, is ([a, b, c], {children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{type:\"symbol\",value:\"a\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}, 1, [[], [a], [b], [c]], 4, Yes, epsilon_cycles_terminate_by_extensional_dedup)."},"skills":["The Complete Bounded Language Includes Epsilon and Terminates Epsilon Cycles"],"verification_warning":"This is a candidate exercise. Mechanical recomputation checks only the stated conditions and this instance; it is neither a formal proof nor human review."}}
{"schema_version":"ocme-question-localization-v0.1","question_id":"q-20261015-advance-20261118-r06-regular-expression-0042","batch_id":"batch-20261015-advance-20261118-r06-regular-expression-foundations","locale":"en","translation_state":"ai_candidate","source":{"question_sha256":"d20037cf2f9d8b1f942d72c32e2e3f6786ba35a411f418a1fc3201cf6afd7e18","family_id":"qf-mod49-regex-bounded-language","seed":202611186042,"semantic_template":"regex-bounded-language|{alphabet:[\"a\",\"b\",\"c\"],max_length:2,regex:{children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}}"},"fields":{"title":"The Complete Bounded Language Includes Epsilon and Terminates Epsilon Cycles","stem":"Use alphabet=[a, b, c] and typed regular-expression AST={\"type\":\"union\",\"children\":[{\"type\":\"union\",\"children\":[{\"type\":\"union\",\"children\":[{\"type\":\"concat\",\"children\":[{\"type\":\"symbol\",\"value\":\"b\"},{\"type\":\"symbol\",\"value\":\"c\"}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"c\"}}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"a\"}}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"b\"}}]}. Words are arrays of alphabet symbols; distinguish empty language from the language containing the empty word. Enumerate every accepted word of length at most=2. Give (alphabet, canonical_typed_AST, max_length, complete_bounded_language, word_count, bounded_enumeration_complete, epsilon_cycle_scope).","answer":{"kind":"expression","value":"([a, b, c], {children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}, 2, [[], [a], [b], [c], [a, a], [b, b], [b, c], [c, c]], 8, Yes, epsilon_cycles_terminate_by_extensional_dedup)","explanation":"Retain all words in length/canonical order and the exact count. Star closure includes the empty word and uses extensional deduplication to terminate epsilon cycles. Completeness is only through the declared bound; it does not establish equivalence of the full unbounded languages. The exact result, retaining the requested order, is ([a, b, c], {children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}, 2, [[], [a], [b], [c], [a, a], [b, b], [b, c], [c, c]], 8, Yes, epsilon_cycles_terminate_by_extensional_dedup)."},"skills":["The Complete Bounded Language Includes Epsilon and Terminates Epsilon Cycles"],"verification_warning":"This is a candidate exercise. Mechanical recomputation checks only the stated conditions and this instance; it is neither a formal proof nor human review."}}
{"schema_version":"ocme-question-localization-v0.1","question_id":"q-20261015-advance-20261118-r06-regular-expression-0043","batch_id":"batch-20261015-advance-20261118-r06-regular-expression-foundations","locale":"en","translation_state":"ai_candidate","source":{"question_sha256":"8763095dd73743115cce4f4d91f2711bf983b4e261bdec92a293cfc495834cb6","family_id":"qf-mod49-regex-bounded-language","seed":202611186043,"semantic_template":"regex-bounded-language|{alphabet:[\"a\",\"b\",\"c\"],max_length:3,regex:{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}}"},"fields":{"title":"The Complete Bounded Language Includes Epsilon and Terminates Epsilon Cycles","stem":"Use alphabet=[a, b, c] and typed regular-expression AST={\"type\":\"union\",\"children\":[{\"type\":\"union\",\"children\":[{\"type\":\"union\",\"children\":[{\"type\":\"concat\",\"children\":[{\"type\":\"symbol\",\"value\":\"c\"},{\"type\":\"symbol\",\"value\":\"a\"},{\"type\":\"symbol\",\"value\":\"b\"}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"a\"}}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"b\"}}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"c\"}}]}. Words are arrays of alphabet symbols; distinguish empty language from the language containing the empty word. Enumerate every accepted word of length at most=3. Give (alphabet, canonical_typed_AST, max_length, complete_bounded_language, word_count, bounded_enumeration_complete, epsilon_cycle_scope).","answer":{"kind":"expression","value":"([a, b, c], {children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}, 3, [[], [a], [b], [c], [a, a], [b, b], [c, c], [a, a, a], [b, b, b], [c, a, b], [c, c, c]], 11, Yes, epsilon_cycles_terminate_by_extensional_dedup)","explanation":"Retain all words in length/canonical order and the exact count. Star closure includes the empty word and uses extensional deduplication to terminate epsilon cycles. Completeness is only through the declared bound; it does not establish equivalence of the full unbounded languages. The exact result, retaining the requested order, is ([a, b, c], {children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}, 3, [[], [a], [b], [c], [a, a], [b, b], [c, c], [a, a, a], [b, b, b], [c, a, b], [c, c, c]], 11, Yes, epsilon_cycles_terminate_by_extensional_dedup)."},"skills":["The Complete Bounded Language Includes Epsilon and Terminates Epsilon Cycles"],"verification_warning":"This is a candidate exercise. Mechanical recomputation checks only the stated conditions and this instance; it is neither a formal proof nor human review."}}
{"schema_version":"ocme-question-localization-v0.1","question_id":"q-20261015-advance-20261118-r06-regular-expression-0044","batch_id":"batch-20261015-advance-20261118-r06-regular-expression-foundations","locale":"en","translation_state":"ai_candidate","source":{"question_sha256":"ca10ef60c9d5293dc92a9eb3b9b9dc94f03cc770c92930383f77936cbb5fea30","family_id":"qf-mod49-regex-bounded-language","seed":202611186044,"semantic_template":"regex-bounded-language|{alphabet:[\"a\",\"b\",\"c\"],max_length:4,regex:{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}}"},"fields":{"title":"The Complete Bounded Language Includes Epsilon and Terminates Epsilon Cycles","stem":"Use alphabet=[a, b, c] and typed regular-expression AST={\"type\":\"union\",\"children\":[{\"type\":\"union\",\"children\":[{\"type\":\"union\",\"children\":[{\"type\":\"concat\",\"children\":[{\"type\":\"symbol\",\"value\":\"a\"},{\"type\":\"symbol\",\"value\":\"b\"},{\"type\":\"symbol\",\"value\":\"c\"},{\"type\":\"symbol\",\"value\":\"a\"}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"b\"}}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"c\"}}]},{\"type\":\"star\",\"child\":{\"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=4. Give (alphabet, canonical_typed_AST, max_length, complete_bounded_language, word_count, bounded_enumeration_complete, epsilon_cycle_scope).","answer":{"kind":"expression","value":"([a, b, c], {children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}, 4, [[], [a], [b], [c], [a, a], [b, b], [c, c], [a, a, a], [b, b, b], [c, c, c], [a, a, a, a], [a, b, c, a], [b, b, b, b], [c, c, c, c]], 14, Yes, epsilon_cycles_terminate_by_extensional_dedup)","explanation":"Retain all words in length/canonical order and the exact count. Star closure includes the empty word and uses extensional deduplication to terminate epsilon cycles. Completeness is only through the declared bound; it does not establish equivalence of the full unbounded languages. The exact result, retaining the requested order, is ([a, b, c], {children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}, 4, [[], [a], [b], [c], [a, a], [b, b], [c, c], [a, a, a], [b, b, b], [c, c, c], [a, a, a, a], [a, b, c, a], [b, b, b, b], [c, c, c, c]], 14, Yes, epsilon_cycles_terminate_by_extensional_dedup)."},"skills":["The Complete Bounded Language Includes Epsilon and Terminates Epsilon Cycles"],"verification_warning":"This is a candidate exercise. Mechanical recomputation checks only the stated conditions and this instance; it is neither a formal proof nor human review."}}
{"schema_version":"ocme-question-localization-v0.1","question_id":"q-20261015-advance-20261118-r06-regular-expression-0045","batch_id":"batch-20261015-advance-20261118-r06-regular-expression-foundations","locale":"en","translation_state":"ai_candidate","source":{"question_sha256":"03b96c2803f525bf2c1e7d2594c7e12412acce23209b5d1b3a68112cbf13a682","family_id":"qf-mod49-regex-bounded-language","seed":202611186045,"semantic_template":"regex-bounded-language|{alphabet:[\"a\",\"b\",\"c\"],max_length:5,regex:{children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}}"},"fields":{"title":"The Complete Bounded Language Includes Epsilon and Terminates Epsilon Cycles","stem":"Use alphabet=[a, b, c] and typed regular-expression AST={\"type\":\"union\",\"children\":[{\"type\":\"union\",\"children\":[{\"type\":\"union\",\"children\":[{\"type\":\"concat\",\"children\":[{\"type\":\"symbol\",\"value\":\"b\"},{\"type\":\"symbol\",\"value\":\"c\"},{\"type\":\"symbol\",\"value\":\"a\"},{\"type\":\"symbol\",\"value\":\"b\"},{\"type\":\"symbol\",\"value\":\"c\"}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"c\"}}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"a\"}}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"b\"}}]}. Words are arrays of alphabet symbols; distinguish empty language from the language containing the empty word. Enumerate every accepted word of length at most=5. Give (alphabet, canonical_typed_AST, max_length, complete_bounded_language, word_count, bounded_enumeration_complete, epsilon_cycle_scope).","answer":{"kind":"expression","value":"([a, b, c], {children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}, 5, [[], [a], [b], [c], [a, a], [b, b], [c, c], [a, a, a], [b, b, b], [c, c, c], [a, a, a, a], [b, b, b, b], [c, c, c, c], [a, a, a, a, a], [b, b, b, b, b], [b, c, a, b, c], [c, c, c, c, c]], 17, Yes, epsilon_cycles_terminate_by_extensional_dedup)","explanation":"Retain all words in length/canonical order and the exact count. Star closure includes the empty word and uses extensional deduplication to terminate epsilon cycles. Completeness is only through the declared bound; it does not establish equivalence of the full unbounded languages. The exact result, retaining the requested order, is ([a, b, c], {children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}, 5, [[], [a], [b], [c], [a, a], [b, b], [c, c], [a, a, a], [b, b, b], [c, c, c], [a, a, a, a], [b, b, b, b], [c, c, c, c], [a, a, a, a, a], [b, b, b, b, b], [b, c, a, b, c], [c, c, c, c, c]], 17, Yes, epsilon_cycles_terminate_by_extensional_dedup)."},"skills":["The Complete Bounded Language Includes Epsilon and Terminates Epsilon Cycles"],"verification_warning":"This is a candidate exercise. Mechanical recomputation checks only the stated conditions and this instance; it is neither a formal proof nor human review."}}
{"schema_version":"ocme-question-localization-v0.1","question_id":"q-20261015-advance-20261118-r06-regular-expression-0046","batch_id":"batch-20261015-advance-20261118-r06-regular-expression-foundations","locale":"en","translation_state":"ai_candidate","source":{"question_sha256":"b74e4c2aab775ead52db8de2f6d5319a4290248e06fb8f492f8d4108d0188dfd","family_id":"qf-mod49-regex-bounded-language","seed":202611186046,"semantic_template":"regex-bounded-language|{alphabet:[\"a\",\"b\",\"c\"],max_length:1,regex:{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{type:\"symbol\",value:\"c\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}}"},"fields":{"title":"The Complete Bounded Language Includes Epsilon and Terminates Epsilon Cycles","stem":"Use alphabet=[a, b, c] and typed regular-expression AST={\"type\":\"union\",\"children\":[{\"type\":\"union\",\"children\":[{\"type\":\"union\",\"children\":[{\"type\":\"union\",\"children\":[{\"type\":\"symbol\",\"value\":\"c\"},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"a\"}}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"b\"}}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"c\"}}]},{\"type\":\"star\",\"child\":{\"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).","answer":{"kind":"expression","value":"([a, b, c], {children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{type:\"symbol\",value:\"c\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}, 1, [[], [a], [b], [c]], 4, Yes, epsilon_cycles_terminate_by_extensional_dedup)","explanation":"Retain all words in length/canonical order and the exact count. Star closure includes the empty word and uses extensional deduplication to terminate epsilon cycles. Completeness is only through the declared bound; it does not establish equivalence of the full unbounded languages. The exact result, retaining the requested order, is ([a, b, c], {children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{type:\"symbol\",value:\"c\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}, 1, [[], [a], [b], [c]], 4, Yes, epsilon_cycles_terminate_by_extensional_dedup)."},"skills":["The Complete Bounded Language Includes Epsilon and Terminates Epsilon Cycles"],"verification_warning":"This is a candidate exercise. Mechanical recomputation checks only the stated conditions and this instance; it is neither a formal proof nor human review."}}
{"schema_version":"ocme-question-localization-v0.1","question_id":"q-20261015-advance-20261118-r06-regular-expression-0047","batch_id":"batch-20261015-advance-20261118-r06-regular-expression-foundations","locale":"en","translation_state":"ai_candidate","source":{"question_sha256":"5f3c3cd4dcec3094fdee9a288a6da430c4d461727f8bb52ae82ebba292878cd7","family_id":"qf-mod49-regex-bounded-language","seed":202611186047,"semantic_template":"regex-bounded-language|{alphabet:[\"a\",\"b\",\"c\"],max_length:2,regex:{children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}}"},"fields":{"title":"The Complete Bounded Language Includes Epsilon and Terminates Epsilon Cycles","stem":"Use alphabet=[a, b, c] and typed regular-expression AST={\"type\":\"union\",\"children\":[{\"type\":\"union\",\"children\":[{\"type\":\"union\",\"children\":[{\"type\":\"union\",\"children\":[{\"type\":\"concat\",\"children\":[{\"type\":\"symbol\",\"value\":\"a\"},{\"type\":\"symbol\",\"value\":\"b\"}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"b\"}}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"c\"}}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"a\"}}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"b\"}}]}. Words are arrays of alphabet symbols; distinguish empty language from the language containing the empty word. Enumerate every accepted word of length at most=2. Give (alphabet, canonical_typed_AST, max_length, complete_bounded_language, word_count, bounded_enumeration_complete, epsilon_cycle_scope).","answer":{"kind":"expression","value":"([a, b, c], {children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}, 2, [[], [a], [b], [c], [a, a], [a, b], [b, b], [c, c]], 8, Yes, epsilon_cycles_terminate_by_extensional_dedup)","explanation":"Retain all words in length/canonical order and the exact count. Star closure includes the empty word and uses extensional deduplication to terminate epsilon cycles. Completeness is only through the declared bound; it does not establish equivalence of the full unbounded languages. The exact result, retaining the requested order, is ([a, b, c], {children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}, 2, [[], [a], [b], [c], [a, a], [a, b], [b, b], [c, c]], 8, Yes, epsilon_cycles_terminate_by_extensional_dedup)."},"skills":["The Complete Bounded Language Includes Epsilon and Terminates Epsilon Cycles"],"verification_warning":"This is a candidate exercise. Mechanical recomputation checks only the stated conditions and this instance; it is neither a formal proof nor human review."}}
{"schema_version":"ocme-question-localization-v0.1","question_id":"q-20261015-advance-20261118-r06-regular-expression-0048","batch_id":"batch-20261015-advance-20261118-r06-regular-expression-foundations","locale":"en","translation_state":"ai_candidate","source":{"question_sha256":"281e775d7577948ce63aaa02abf060b155684febabdc804f5e6d5915c8e83f9b","family_id":"qf-mod49-regex-bounded-language","seed":202611186048,"semantic_template":"regex-bounded-language|{alphabet:[\"a\",\"b\",\"c\"],max_length:3,regex:{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}}"},"fields":{"title":"The Complete Bounded Language Includes Epsilon and Terminates Epsilon Cycles","stem":"Use alphabet=[a, b, c] and typed regular-expression AST={\"type\":\"union\",\"children\":[{\"type\":\"union\",\"children\":[{\"type\":\"union\",\"children\":[{\"type\":\"union\",\"children\":[{\"type\":\"concat\",\"children\":[{\"type\":\"symbol\",\"value\":\"b\"},{\"type\":\"symbol\",\"value\":\"c\"},{\"type\":\"symbol\",\"value\":\"a\"}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"c\"}}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"a\"}}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"b\"}}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"c\"}}]}. Words are arrays of alphabet symbols; distinguish empty language from the language containing the empty word. Enumerate every accepted word of length at most=3. Give (alphabet, canonical_typed_AST, max_length, complete_bounded_language, word_count, bounded_enumeration_complete, epsilon_cycle_scope).","answer":{"kind":"expression","value":"([a, b, c], {children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}, 3, [[], [a], [b], [c], [a, a], [b, b], [c, c], [a, a, a], [b, b, b], [b, c, a], [c, c, c]], 11, Yes, epsilon_cycles_terminate_by_extensional_dedup)","explanation":"Retain all words in length/canonical order and the exact count. Star closure includes the empty word and uses extensional deduplication to terminate epsilon cycles. Completeness is only through the declared bound; it does not establish equivalence of the full unbounded languages. The exact result, retaining the requested order, is ([a, b, c], {children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}, 3, [[], [a], [b], [c], [a, a], [b, b], [c, c], [a, a, a], [b, b, b], [b, c, a], [c, c, c]], 11, Yes, epsilon_cycles_terminate_by_extensional_dedup)."},"skills":["The Complete Bounded Language Includes Epsilon and Terminates Epsilon Cycles"],"verification_warning":"This is a candidate exercise. Mechanical recomputation checks only the stated conditions and this instance; it is neither a formal proof nor human review."}}
{"schema_version":"ocme-question-localization-v0.1","question_id":"q-20261015-advance-20261118-r06-regular-expression-0049","batch_id":"batch-20261015-advance-20261118-r06-regular-expression-foundations","locale":"en","translation_state":"ai_candidate","source":{"question_sha256":"23926ee1ce8cdcd8a9e959cc0eb3d1de5ffce63f75e654d5b9a77ba22619ff2e","family_id":"qf-mod49-regex-bounded-language","seed":202611186049,"semantic_template":"regex-bounded-language|{alphabet:[\"a\",\"b\",\"c\"],max_length:4,regex:{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}}"},"fields":{"title":"The Complete Bounded Language Includes Epsilon and Terminates Epsilon Cycles","stem":"Use alphabet=[a, b, c] and typed regular-expression AST={\"type\":\"union\",\"children\":[{\"type\":\"union\",\"children\":[{\"type\":\"union\",\"children\":[{\"type\":\"union\",\"children\":[{\"type\":\"concat\",\"children\":[{\"type\":\"symbol\",\"value\":\"c\"},{\"type\":\"symbol\",\"value\":\"a\"},{\"type\":\"symbol\",\"value\":\"b\"},{\"type\":\"symbol\",\"value\":\"c\"}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"a\"}}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"b\"}}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"c\"}}]},{\"type\":\"star\",\"child\":{\"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=4. Give (alphabet, canonical_typed_AST, max_length, complete_bounded_language, word_count, bounded_enumeration_complete, epsilon_cycle_scope).","answer":{"kind":"expression","value":"([a, b, c], {children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}, 4, [[], [a], [b], [c], [a, a], [b, b], [c, c], [a, a, a], [b, b, b], [c, c, c], [a, a, a, a], [b, b, b, b], [c, a, b, c], [c, c, c, c]], 14, Yes, epsilon_cycles_terminate_by_extensional_dedup)","explanation":"Retain all words in length/canonical order and the exact count. Star closure includes the empty word and uses extensional deduplication to terminate epsilon cycles. Completeness is only through the declared bound; it does not establish equivalence of the full unbounded languages. The exact result, retaining the requested order, is ([a, b, c], {children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}, 4, [[], [a], [b], [c], [a, a], [b, b], [c, c], [a, a, a], [b, b, b], [c, c, c], [a, a, a, a], [b, b, b, b], [c, a, b, c], [c, c, c, c]], 14, Yes, epsilon_cycles_terminate_by_extensional_dedup)."},"skills":["The Complete Bounded Language Includes Epsilon and Terminates Epsilon Cycles"],"verification_warning":"This is a candidate exercise. Mechanical recomputation checks only the stated conditions and this instance; it is neither a formal proof nor human review."}}
{"schema_version":"ocme-question-localization-v0.1","question_id":"q-20261015-advance-20261118-r06-regular-expression-0050","batch_id":"batch-20261015-advance-20261118-r06-regular-expression-foundations","locale":"en","translation_state":"ai_candidate","source":{"question_sha256":"bb37fc9ee294b90049a068b3ef0259fcfb1a1f3697b07dd8d0d9e5e2211a1990","family_id":"qf-mod49-regex-bounded-language","seed":202611186050,"semantic_template":"regex-bounded-language|{alphabet:[\"a\",\"b\",\"c\"],max_length:5,regex:{children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}}"},"fields":{"title":"The Complete Bounded Language Includes Epsilon and Terminates Epsilon Cycles","stem":"Use alphabet=[a, b, c] and typed regular-expression AST={\"type\":\"union\",\"children\":[{\"type\":\"union\",\"children\":[{\"type\":\"union\",\"children\":[{\"type\":\"union\",\"children\":[{\"type\":\"concat\",\"children\":[{\"type\":\"symbol\",\"value\":\"a\"},{\"type\":\"symbol\",\"value\":\"b\"},{\"type\":\"symbol\",\"value\":\"c\"},{\"type\":\"symbol\",\"value\":\"a\"},{\"type\":\"symbol\",\"value\":\"b\"}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"b\"}}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"c\"}}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"a\"}}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"b\"}}]}. Words are arrays of alphabet symbols; distinguish empty language from the language containing the empty word. Enumerate every accepted word of length at most=5. Give (alphabet, canonical_typed_AST, max_length, complete_bounded_language, word_count, bounded_enumeration_complete, epsilon_cycle_scope).","answer":{"kind":"expression","value":"([a, b, c], {children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}, 5, [[], [a], [b], [c], [a, a], [b, b], [c, c], [a, a, a], [b, b, b], [c, c, c], [a, a, a, a], [b, b, b, b], [c, c, c, c], [a, a, a, a, a], [a, b, c, a, b], [b, b, b, b, b], [c, c, c, c, c]], 17, Yes, epsilon_cycles_terminate_by_extensional_dedup)","explanation":"Retain all words in length/canonical order and the exact count. Star closure includes the empty word and uses extensional deduplication to terminate epsilon cycles. Completeness is only through the declared bound; it does not establish equivalence of the full unbounded languages. The exact result, retaining the requested order, is ([a, b, c], {children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}, 5, [[], [a], [b], [c], [a, a], [b, b], [c, c], [a, a, a], [b, b, b], [c, c, c], [a, a, a, a], [b, b, b, b], [c, c, c, c], [a, a, a, a, a], [a, b, c, a, b], [b, b, b, b, b], [c, c, c, c, c]], 17, Yes, epsilon_cycles_terminate_by_extensional_dedup)."},"skills":["The Complete Bounded Language Includes Epsilon and Terminates Epsilon Cycles"],"verification_warning":"This is a candidate exercise. Mechanical recomputation checks only the stated conditions and this instance; it is neither a formal proof nor human review."}}
{"schema_version":"ocme-question-localization-v0.1","question_id":"q-20261015-advance-20261118-r06-regular-expression-0051","batch_id":"batch-20261015-advance-20261118-r06-regular-expression-foundations","locale":"en","translation_state":"ai_candidate","source":{"question_sha256":"d54396237bd857fc711d960e5b5278aac5160852e2fd7090b8667604edf53df6","family_id":"qf-mod49-regex-word-membership","seed":202611186051,"semantic_template":"regex-word-membership|{alphabet:[\"a\",\"b\",\"c\"],regex:{type:\"symbol\",value:\"a\"},word:[]}"},"fields":{"title":"Whole-Word Membership Uses a Sufficient Complete Length Slice","stem":"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. Decide word=[]. Give (alphabet, canonical_typed_AST, word, member, accepted_words_at_same_length, membership_scope).","answer":{"kind":"expression","value":"([a, b, c], {type:\"symbol\",value:\"a\"}, [], No, [], complete_membership_not_absence_from_an_insufficient_bound)","explanation":"Compute membership at exactly this word length, with a complete accepted-word slice for that length. Do not infer nonmembership merely because an insufficient shorter bound omitted the word. [] is an empty word when used as a word, while [] as a language contains no words. The exact result, retaining the requested order, is ([a, b, c], {type:\"symbol\",value:\"a\"}, [], No, [], complete_membership_not_absence_from_an_insufficient_bound)."},"skills":["Whole-Word Membership Uses a Sufficient Complete Length Slice"],"verification_warning":"This is a candidate exercise. Mechanical recomputation checks only the stated conditions and this instance; it is neither a formal proof nor human review."}}
{"schema_version":"ocme-question-localization-v0.1","question_id":"q-20261015-advance-20261118-r06-regular-expression-0052","batch_id":"batch-20261015-advance-20261118-r06-regular-expression-foundations","locale":"en","translation_state":"ai_candidate","source":{"question_sha256":"fecfb90c3bca02b0616c8053c423ba19a621ab9575a85d6ad6f4a0ac9a4f20b5","family_id":"qf-mod49-regex-word-membership","seed":202611186052,"semantic_template":"regex-word-membership|{alphabet:[\"a\",\"b\",\"c\"],regex:{children:[{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"}],type:\"concat\"},word:[\"b\"]}"},"fields":{"title":"Whole-Word Membership Uses a Sufficient Complete Length Slice","stem":"Use alphabet=[a, b, c] and typed regular-expression AST={\"type\":\"concat\",\"children\":[{\"type\":\"symbol\",\"value\":\"b\"},{\"type\":\"symbol\",\"value\":\"c\"}]}. Words are arrays of alphabet symbols; distinguish empty language from the language containing the empty word. Decide word=[b]. Give (alphabet, canonical_typed_AST, word, member, accepted_words_at_same_length, membership_scope).","answer":{"kind":"expression","value":"([a, b, c], {children:[{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"}],type:\"concat\"}, [b], No, [], complete_membership_not_absence_from_an_insufficient_bound)","explanation":"Compute membership at exactly this word length, with a complete accepted-word slice for that length. Do not infer nonmembership merely because an insufficient shorter bound omitted the word. [] is an empty word when used as a word, while [] as a language contains no words. The exact result, retaining the requested order, is ([a, b, c], {children:[{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"}],type:\"concat\"}, [b], No, [], complete_membership_not_absence_from_an_insufficient_bound)."},"skills":["Whole-Word Membership Uses a Sufficient Complete Length Slice"],"verification_warning":"This is a candidate exercise. Mechanical recomputation checks only the stated conditions and this instance; it is neither a formal proof nor human review."}}
{"schema_version":"ocme-question-localization-v0.1","question_id":"q-20261015-advance-20261118-r06-regular-expression-0053","batch_id":"batch-20261015-advance-20261118-r06-regular-expression-foundations","locale":"en","translation_state":"ai_candidate","source":{"question_sha256":"f3301c9c6bd362db7c4ee4fd6b26ed4590f1d19deeff5a52e8b7a9e21c0e5005","family_id":"qf-mod49-regex-word-membership","seed":202611186053,"semantic_template":"regex-word-membership|{alphabet:[\"a\",\"b\",\"c\"],regex:{children:[{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"}],type:\"concat\"},word:[\"c\",\"a\"]}"},"fields":{"title":"Whole-Word Membership Uses a Sufficient Complete Length Slice","stem":"Use alphabet=[a, b, c] and typed regular-expression AST={\"type\":\"concat\",\"children\":[{\"type\":\"symbol\",\"value\":\"c\"},{\"type\":\"symbol\",\"value\":\"a\"},{\"type\":\"symbol\",\"value\":\"b\"}]}. Words are arrays of alphabet symbols; distinguish empty language from the language containing the empty word. Decide word=[c, a]. Give (alphabet, canonical_typed_AST, word, member, accepted_words_at_same_length, membership_scope).","answer":{"kind":"expression","value":"([a, b, c], {children:[{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"}],type:\"concat\"}, [c, a], No, [], complete_membership_not_absence_from_an_insufficient_bound)","explanation":"Compute membership at exactly this word length, with a complete accepted-word slice for that length. Do not infer nonmembership merely because an insufficient shorter bound omitted the word. [] is an empty word when used as a word, while [] as a language contains no words. The exact result, retaining the requested order, is ([a, b, c], {children:[{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"}],type:\"concat\"}, [c, a], No, [], complete_membership_not_absence_from_an_insufficient_bound)."},"skills":["Whole-Word Membership Uses a Sufficient Complete Length Slice"],"verification_warning":"This is a candidate exercise. Mechanical recomputation checks only the stated conditions and this instance; it is neither a formal proof nor human review."}}
{"schema_version":"ocme-question-localization-v0.1","question_id":"q-20261015-advance-20261118-r06-regular-expression-0054","batch_id":"batch-20261015-advance-20261118-r06-regular-expression-foundations","locale":"en","translation_state":"ai_candidate","source":{"question_sha256":"64f6f5708e05ff5e64a5aca9fa4a8519707dc4f80e44ff948e9945ba979590e1","family_id":"qf-mod49-regex-word-membership","seed":202611186054,"semantic_template":"regex-word-membership|{alphabet:[\"a\",\"b\",\"c\"],regex:{children:[{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"}],type:\"concat\"},word:[\"a\",\"b\",\"c\"]}"},"fields":{"title":"Whole-Word Membership Uses a Sufficient Complete Length Slice","stem":"Use alphabet=[a, b, c] and typed regular-expression AST={\"type\":\"concat\",\"children\":[{\"type\":\"symbol\",\"value\":\"a\"},{\"type\":\"symbol\",\"value\":\"b\"},{\"type\":\"symbol\",\"value\":\"c\"},{\"type\":\"symbol\",\"value\":\"a\"}]}. Words are arrays of alphabet symbols; distinguish empty language from the language containing the empty word. Decide word=[a, b, c]. Give (alphabet, canonical_typed_AST, word, member, accepted_words_at_same_length, membership_scope).","answer":{"kind":"expression","value":"([a, b, c], {children:[{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"}],type:\"concat\"}, [a, b, c], No, [], complete_membership_not_absence_from_an_insufficient_bound)","explanation":"Compute membership at exactly this word length, with a complete accepted-word slice for that length. Do not infer nonmembership merely because an insufficient shorter bound omitted the word. [] is an empty word when used as a word, while [] as a language contains no words. The exact result, retaining the requested order, is ([a, b, c], {children:[{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"}],type:\"concat\"}, [a, b, c], No, [], complete_membership_not_absence_from_an_insufficient_bound)."},"skills":["Whole-Word Membership Uses a Sufficient Complete Length Slice"],"verification_warning":"This is a candidate exercise. Mechanical recomputation checks only the stated conditions and this instance; it is neither a formal proof nor human review."}}
{"schema_version":"ocme-question-localization-v0.1","question_id":"q-20261015-advance-20261118-r06-regular-expression-0055","batch_id":"batch-20261015-advance-20261118-r06-regular-expression-foundations","locale":"en","translation_state":"ai_candidate","source":{"question_sha256":"0833aaea75100cb80c510744f558215c156fd632a294ba01be7f695fb4668e7d","family_id":"qf-mod49-regex-word-membership","seed":202611186055,"semantic_template":"regex-word-membership|{alphabet:[\"a\",\"b\",\"c\"],regex:{children:[{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"}],type:\"concat\"},word:[\"b\",\"c\",\"a\",\"b\"]}"},"fields":{"title":"Whole-Word Membership Uses a Sufficient Complete Length Slice","stem":"Use alphabet=[a, b, c] and typed regular-expression AST={\"type\":\"concat\",\"children\":[{\"type\":\"symbol\",\"value\":\"b\"},{\"type\":\"symbol\",\"value\":\"c\"},{\"type\":\"symbol\",\"value\":\"a\"},{\"type\":\"symbol\",\"value\":\"b\"},{\"type\":\"symbol\",\"value\":\"c\"}]}. Words are arrays of alphabet symbols; distinguish empty language from the language containing the empty word. Decide word=[b, c, a, b]. Give (alphabet, canonical_typed_AST, word, member, accepted_words_at_same_length, membership_scope).","answer":{"kind":"expression","value":"([a, b, c], {children:[{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"}],type:\"concat\"}, [b, c, a, b], No, [], complete_membership_not_absence_from_an_insufficient_bound)","explanation":"Compute membership at exactly this word length, with a complete accepted-word slice for that length. Do not infer nonmembership merely because an insufficient shorter bound omitted the word. [] is an empty word when used as a word, while [] as a language contains no words. The exact result, retaining the requested order, is ([a, b, c], {children:[{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"}],type:\"concat\"}, [b, c, a, b], No, [], complete_membership_not_absence_from_an_insufficient_bound)."},"skills":["Whole-Word Membership Uses a Sufficient Complete Length Slice"],"verification_warning":"This is a candidate exercise. Mechanical recomputation checks only the stated conditions and this instance; it is neither a formal proof nor human review."}}
{"schema_version":"ocme-question-localization-v0.1","question_id":"q-20261015-advance-20261118-r06-regular-expression-0056","batch_id":"batch-20261015-advance-20261118-r06-regular-expression-foundations","locale":"en","translation_state":"ai_candidate","source":{"question_sha256":"789b1b28be259fe9da5b8017f07cb5dcff19b8b56c1e5facbf7bf890eed589d2","family_id":"qf-mod49-regex-word-membership","seed":202611186056,"semantic_template":"regex-word-membership|{alphabet:[\"a\",\"b\",\"c\"],regex:{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{type:\"symbol\",value:\"c\"}],type:\"union\"},word:[]}"},"fields":{"title":"Whole-Word Membership Uses a Sufficient Complete Length Slice","stem":"Use alphabet=[a, b, c] and typed regular-expression AST={\"type\":\"union\",\"children\":[{\"type\":\"symbol\",\"value\":\"c\"},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"a\"}}]}. Words are arrays of alphabet symbols; distinguish empty language from the language containing the empty word. Decide word=[]. Give (alphabet, canonical_typed_AST, word, member, accepted_words_at_same_length, membership_scope).","answer":{"kind":"expression","value":"([a, b, c], {children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{type:\"symbol\",value:\"c\"}],type:\"union\"}, [], Yes, [[]], complete_membership_not_absence_from_an_insufficient_bound)","explanation":"Compute membership at exactly this word length, with a complete accepted-word slice for that length. Do not infer nonmembership merely because an insufficient shorter bound omitted the word. [] is an empty word when used as a word, while [] as a language contains no words. The exact result, retaining the requested order, is ([a, b, c], {children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{type:\"symbol\",value:\"c\"}],type:\"union\"}, [], Yes, [[]], complete_membership_not_absence_from_an_insufficient_bound)."},"skills":["Whole-Word Membership Uses a Sufficient Complete Length Slice"],"verification_warning":"This is a candidate exercise. Mechanical recomputation checks only the stated conditions and this instance; it is neither a formal proof nor human review."}}
{"schema_version":"ocme-question-localization-v0.1","question_id":"q-20261015-advance-20261118-r06-regular-expression-0057","batch_id":"batch-20261015-advance-20261118-r06-regular-expression-foundations","locale":"en","translation_state":"ai_candidate","source":{"question_sha256":"45f699e3812c817bb67cefb27c6300de88e08277149824c8cb6733d1fd2e9b05","family_id":"qf-mod49-regex-word-membership","seed":202611186057,"semantic_template":"regex-word-membership|{alphabet:[\"a\",\"b\",\"c\"],regex:{children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"}],type:\"concat\"}],type:\"union\"},word:[\"a\"]}"},"fields":{"title":"Whole-Word Membership Uses a Sufficient Complete Length Slice","stem":"Use alphabet=[a, b, c] and typed regular-expression AST={\"type\":\"union\",\"children\":[{\"type\":\"concat\",\"children\":[{\"type\":\"symbol\",\"value\":\"a\"},{\"type\":\"symbol\",\"value\":\"b\"}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"b\"}}]}. Words are arrays of alphabet symbols; distinguish empty language from the language containing the empty word. Decide word=[a]. Give (alphabet, canonical_typed_AST, word, member, accepted_words_at_same_length, membership_scope).","answer":{"kind":"expression","value":"([a, b, c], {children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"}],type:\"concat\"}],type:\"union\"}, [a], No, [[b]], complete_membership_not_absence_from_an_insufficient_bound)","explanation":"Compute membership at exactly this word length, with a complete accepted-word slice for that length. Do not infer nonmembership merely because an insufficient shorter bound omitted the word. [] is an empty word when used as a word, while [] as a language contains no words. The exact result, retaining the requested order, is ([a, b, c], {children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"}],type:\"concat\"}],type:\"union\"}, [a], No, [[b]], complete_membership_not_absence_from_an_insufficient_bound)."},"skills":["Whole-Word Membership Uses a Sufficient Complete Length Slice"],"verification_warning":"This is a candidate exercise. Mechanical recomputation checks only the stated conditions and this instance; it is neither a formal proof nor human review."}}
{"schema_version":"ocme-question-localization-v0.1","question_id":"q-20261015-advance-20261118-r06-regular-expression-0058","batch_id":"batch-20261015-advance-20261118-r06-regular-expression-foundations","locale":"en","translation_state":"ai_candidate","source":{"question_sha256":"2085257ed2659cac2cba9ff89f121609ed5ff95c632c147d202749874c55b08b","family_id":"qf-mod49-regex-word-membership","seed":202611186058,"semantic_template":"regex-word-membership|{alphabet:[\"a\",\"b\",\"c\"],regex:{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"}],type:\"concat\"}],type:\"union\"},word:[\"b\",\"c\"]}"},"fields":{"title":"Whole-Word Membership Uses a Sufficient Complete Length Slice","stem":"Use alphabet=[a, b, c] and typed regular-expression AST={\"type\":\"union\",\"children\":[{\"type\":\"concat\",\"children\":[{\"type\":\"symbol\",\"value\":\"b\"},{\"type\":\"symbol\",\"value\":\"c\"},{\"type\":\"symbol\",\"value\":\"a\"}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"c\"}}]}. Words are arrays of alphabet symbols; distinguish empty language from the language containing the empty word. Decide word=[b, c]. Give (alphabet, canonical_typed_AST, word, member, accepted_words_at_same_length, membership_scope).","answer":{"kind":"expression","value":"([a, b, c], {children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"}],type:\"concat\"}],type:\"union\"}, [b, c], No, [[c, c]], complete_membership_not_absence_from_an_insufficient_bound)","explanation":"Compute membership at exactly this word length, with a complete accepted-word slice for that length. Do not infer nonmembership merely because an insufficient shorter bound omitted the word. [] is an empty word when used as a word, while [] as a language contains no words. The exact result, retaining the requested order, is ([a, b, c], {children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"}],type:\"concat\"}],type:\"union\"}, [b, c], No, [[c, c]], complete_membership_not_absence_from_an_insufficient_bound)."},"skills":["Whole-Word Membership Uses a Sufficient Complete Length Slice"],"verification_warning":"This is a candidate exercise. Mechanical recomputation checks only the stated conditions and this instance; it is neither a formal proof nor human review."}}
{"schema_version":"ocme-question-localization-v0.1","question_id":"q-20261015-advance-20261118-r06-regular-expression-0059","batch_id":"batch-20261015-advance-20261118-r06-regular-expression-foundations","locale":"en","translation_state":"ai_candidate","source":{"question_sha256":"da4eaf9081265b4ce2bcba672b7b952e49e5024517be8ee63c2f6622ce9b0406","family_id":"qf-mod49-regex-word-membership","seed":202611186059,"semantic_template":"regex-word-membership|{alphabet:[\"a\",\"b\",\"c\"],regex:{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"}],type:\"concat\"}],type:\"union\"},word:[\"c\",\"a\",\"b\"]}"},"fields":{"title":"Whole-Word Membership Uses a Sufficient Complete Length Slice","stem":"Use alphabet=[a, b, c] and typed regular-expression AST={\"type\":\"union\",\"children\":[{\"type\":\"concat\",\"children\":[{\"type\":\"symbol\",\"value\":\"c\"},{\"type\":\"symbol\",\"value\":\"a\"},{\"type\":\"symbol\",\"value\":\"b\"},{\"type\":\"symbol\",\"value\":\"c\"}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"a\"}}]}. Words are arrays of alphabet symbols; distinguish empty language from the language containing the empty word. Decide word=[c, a, b]. Give (alphabet, canonical_typed_AST, word, member, accepted_words_at_same_length, membership_scope).","answer":{"kind":"expression","value":"([a, b, c], {children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"}],type:\"concat\"}],type:\"union\"}, [c, a, b], No, [[a, a, a]], complete_membership_not_absence_from_an_insufficient_bound)","explanation":"Compute membership at exactly this word length, with a complete accepted-word slice for that length. Do not infer nonmembership merely because an insufficient shorter bound omitted the word. [] is an empty word when used as a word, while [] as a language contains no words. The exact result, retaining the requested order, is ([a, b, c], {children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"}],type:\"concat\"}],type:\"union\"}, [c, a, b], No, [[a, a, a]], complete_membership_not_absence_from_an_insufficient_bound)."},"skills":["Whole-Word Membership Uses a Sufficient Complete Length Slice"],"verification_warning":"This is a candidate exercise. Mechanical recomputation checks only the stated conditions and this instance; it is neither a formal proof nor human review."}}
{"schema_version":"ocme-question-localization-v0.1","question_id":"q-20261015-advance-20261118-r06-regular-expression-0060","batch_id":"batch-20261015-advance-20261118-r06-regular-expression-foundations","locale":"en","translation_state":"ai_candidate","source":{"question_sha256":"d96b83f1a31e9f038ab665732ff5219acf728ff8e43857494f22bf6a5722d9f0","family_id":"qf-mod49-regex-word-membership","seed":202611186060,"semantic_template":"regex-word-membership|{alphabet:[\"a\",\"b\",\"c\"],regex:{children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"}],type:\"concat\"}],type:\"union\"},word:[\"a\",\"b\",\"c\",\"a\"]}"},"fields":{"title":"Whole-Word Membership Uses a Sufficient Complete Length Slice","stem":"Use alphabet=[a, b, c] and typed regular-expression AST={\"type\":\"union\",\"children\":[{\"type\":\"concat\",\"children\":[{\"type\":\"symbol\",\"value\":\"a\"},{\"type\":\"symbol\",\"value\":\"b\"},{\"type\":\"symbol\",\"value\":\"c\"},{\"type\":\"symbol\",\"value\":\"a\"},{\"type\":\"symbol\",\"value\":\"b\"}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"b\"}}]}. Words are arrays of alphabet symbols; distinguish empty language from the language containing the empty word. Decide word=[a, b, c, a]. Give (alphabet, canonical_typed_AST, word, member, accepted_words_at_same_length, membership_scope).","answer":{"kind":"expression","value":"([a, b, c], {children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"}],type:\"concat\"}],type:\"union\"}, [a, b, c, a], No, [[b, b, b, b]], complete_membership_not_absence_from_an_insufficient_bound)","explanation":"Compute membership at exactly this word length, with a complete accepted-word slice for that length. Do not infer nonmembership merely because an insufficient shorter bound omitted the word. [] is an empty word when used as a word, while [] as a language contains no words. The exact result, retaining the requested order, is ([a, b, c], {children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"}],type:\"concat\"}],type:\"union\"}, [a, b, c, a], No, [[b, b, b, b]], complete_membership_not_absence_from_an_insufficient_bound)."},"skills":["Whole-Word Membership Uses a Sufficient Complete Length Slice"],"verification_warning":"This is a candidate exercise. Mechanical recomputation checks only the stated conditions and this instance; it is neither a formal proof nor human review."}}
{"schema_version":"ocme-question-localization-v0.1","question_id":"q-20261015-advance-20261118-r06-regular-expression-0061","batch_id":"batch-20261015-advance-20261118-r06-regular-expression-foundations","locale":"en","translation_state":"ai_candidate","source":{"question_sha256":"93178433360c17bdd00feda8bf1f03db7b57f9216f39418d5cbdf1b271c2e29b","family_id":"qf-mod49-regex-word-membership","seed":202611186061,"semantic_template":"regex-word-membership|{alphabet:[\"a\",\"b\",\"c\"],regex:{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{type:\"symbol\",value:\"b\"}],type:\"union\"}],type:\"union\"},word:[]}"},"fields":{"title":"Whole-Word Membership Uses a Sufficient Complete Length Slice","stem":"Use alphabet=[a, b, c] and typed regular-expression AST={\"type\":\"union\",\"children\":[{\"type\":\"union\",\"children\":[{\"type\":\"symbol\",\"value\":\"b\"},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"c\"}}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"a\"}}]}. Words are arrays of alphabet symbols; distinguish empty language from the language containing the empty word. Decide word=[]. Give (alphabet, canonical_typed_AST, word, member, accepted_words_at_same_length, membership_scope).","answer":{"kind":"expression","value":"([a, b, c], {children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{type:\"symbol\",value:\"b\"}],type:\"union\"}],type:\"union\"}, [], Yes, [[]], complete_membership_not_absence_from_an_insufficient_bound)","explanation":"Compute membership at exactly this word length, with a complete accepted-word slice for that length. Do not infer nonmembership merely because an insufficient shorter bound omitted the word. [] is an empty word when used as a word, while [] as a language contains no words. The exact result, retaining the requested order, is ([a, b, c], {children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{type:\"symbol\",value:\"b\"}],type:\"union\"}],type:\"union\"}, [], Yes, [[]], complete_membership_not_absence_from_an_insufficient_bound)."},"skills":["Whole-Word Membership Uses a Sufficient Complete Length Slice"],"verification_warning":"This is a candidate exercise. Mechanical recomputation checks only the stated conditions and this instance; it is neither a formal proof nor human review."}}
{"schema_version":"ocme-question-localization-v0.1","question_id":"q-20261015-advance-20261118-r06-regular-expression-0062","batch_id":"batch-20261015-advance-20261118-r06-regular-expression-foundations","locale":"en","translation_state":"ai_candidate","source":{"question_sha256":"5f52902c01ae7c632cddb4118ca8aae3a28ed2dbdc2094c848640bd014c4a271","family_id":"qf-mod49-regex-word-membership","seed":202611186062,"semantic_template":"regex-word-membership|{alphabet:[\"a\",\"b\",\"c\"],regex:{children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"},word:[\"c\"]}"},"fields":{"title":"Whole-Word Membership Uses a Sufficient Complete Length Slice","stem":"Use alphabet=[a, b, c] and typed regular-expression AST={\"type\":\"union\",\"children\":[{\"type\":\"union\",\"children\":[{\"type\":\"concat\",\"children\":[{\"type\":\"symbol\",\"value\":\"c\"},{\"type\":\"symbol\",\"value\":\"a\"}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"a\"}}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"b\"}}]}. Words are arrays of alphabet symbols; distinguish empty language from the language containing the empty word. Decide word=[c]. Give (alphabet, canonical_typed_AST, word, member, accepted_words_at_same_length, membership_scope).","answer":{"kind":"expression","value":"([a, b, c], {children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"}, [c], No, [[a], [b]], complete_membership_not_absence_from_an_insufficient_bound)","explanation":"Compute membership at exactly this word length, with a complete accepted-word slice for that length. Do not infer nonmembership merely because an insufficient shorter bound omitted the word. [] is an empty word when used as a word, while [] as a language contains no words. The exact result, retaining the requested order, is ([a, b, c], {children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"}, [c], No, [[a], [b]], complete_membership_not_absence_from_an_insufficient_bound)."},"skills":["Whole-Word Membership Uses a Sufficient Complete Length Slice"],"verification_warning":"This is a candidate exercise. Mechanical recomputation checks only the stated conditions and this instance; it is neither a formal proof nor human review."}}
{"schema_version":"ocme-question-localization-v0.1","question_id":"q-20261015-advance-20261118-r06-regular-expression-0063","batch_id":"batch-20261015-advance-20261118-r06-regular-expression-foundations","locale":"en","translation_state":"ai_candidate","source":{"question_sha256":"7b82cd19e9e1c815cb4769dce04d7f9640be7a7fd2c1313334fd61d377c94752","family_id":"qf-mod49-regex-word-membership","seed":202611186063,"semantic_template":"regex-word-membership|{alphabet:[\"a\",\"b\",\"c\"],regex:{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"},word:[\"a\",\"b\"]}"},"fields":{"title":"Whole-Word Membership Uses a Sufficient Complete Length Slice","stem":"Use alphabet=[a, b, c] and typed regular-expression AST={\"type\":\"union\",\"children\":[{\"type\":\"union\",\"children\":[{\"type\":\"concat\",\"children\":[{\"type\":\"symbol\",\"value\":\"a\"},{\"type\":\"symbol\",\"value\":\"b\"},{\"type\":\"symbol\",\"value\":\"c\"}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"b\"}}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"c\"}}]}. Words are arrays of alphabet symbols; distinguish empty language from the language containing the empty word. Decide word=[a, b]. Give (alphabet, canonical_typed_AST, word, member, accepted_words_at_same_length, membership_scope).","answer":{"kind":"expression","value":"([a, b, c], {children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"}, [a, b], No, [[b, b], [c, c]], complete_membership_not_absence_from_an_insufficient_bound)","explanation":"Compute membership at exactly this word length, with a complete accepted-word slice for that length. Do not infer nonmembership merely because an insufficient shorter bound omitted the word. [] is an empty word when used as a word, while [] as a language contains no words. The exact result, retaining the requested order, is ([a, b, c], {children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"}, [a, b], No, [[b, b], [c, c]], complete_membership_not_absence_from_an_insufficient_bound)."},"skills":["Whole-Word Membership Uses a Sufficient Complete Length Slice"],"verification_warning":"This is a candidate exercise. Mechanical recomputation checks only the stated conditions and this instance; it is neither a formal proof nor human review."}}
{"schema_version":"ocme-question-localization-v0.1","question_id":"q-20261015-advance-20261118-r06-regular-expression-0064","batch_id":"batch-20261015-advance-20261118-r06-regular-expression-foundations","locale":"en","translation_state":"ai_candidate","source":{"question_sha256":"c65e5abc5a9fe77e62169ca05361fad2ac4bad0312c28af16d3056dab30761be","family_id":"qf-mod49-regex-word-membership","seed":202611186064,"semantic_template":"regex-word-membership|{alphabet:[\"a\",\"b\",\"c\"],regex:{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"},word:[\"b\",\"c\",\"a\"]}"},"fields":{"title":"Whole-Word Membership Uses a Sufficient Complete Length Slice","stem":"Use alphabet=[a, b, c] and typed regular-expression AST={\"type\":\"union\",\"children\":[{\"type\":\"union\",\"children\":[{\"type\":\"concat\",\"children\":[{\"type\":\"symbol\",\"value\":\"b\"},{\"type\":\"symbol\",\"value\":\"c\"},{\"type\":\"symbol\",\"value\":\"a\"},{\"type\":\"symbol\",\"value\":\"b\"}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"c\"}}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"a\"}}]}. Words are arrays of alphabet symbols; distinguish empty language from the language containing the empty word. Decide word=[b, c, a]. Give (alphabet, canonical_typed_AST, word, member, accepted_words_at_same_length, membership_scope).","answer":{"kind":"expression","value":"([a, b, c], {children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"}, [b, c, a], No, [[a, a, a], [c, c, c]], complete_membership_not_absence_from_an_insufficient_bound)","explanation":"Compute membership at exactly this word length, with a complete accepted-word slice for that length. Do not infer nonmembership merely because an insufficient shorter bound omitted the word. [] is an empty word when used as a word, while [] as a language contains no words. The exact result, retaining the requested order, is ([a, b, c], {children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"}, [b, c, a], No, [[a, a, a], [c, c, c]], complete_membership_not_absence_from_an_insufficient_bound)."},"skills":["Whole-Word Membership Uses a Sufficient Complete Length Slice"],"verification_warning":"This is a candidate exercise. Mechanical recomputation checks only the stated conditions and this instance; it is neither a formal proof nor human review."}}
{"schema_version":"ocme-question-localization-v0.1","question_id":"q-20261015-advance-20261118-r06-regular-expression-0065","batch_id":"batch-20261015-advance-20261118-r06-regular-expression-foundations","locale":"en","translation_state":"ai_candidate","source":{"question_sha256":"92cb27b253dff5e66c1ae46df7418418e20d61921f0988714c37130c01e4edd7","family_id":"qf-mod49-regex-word-membership","seed":202611186065,"semantic_template":"regex-word-membership|{alphabet:[\"a\",\"b\",\"c\"],regex:{children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"},word:[\"c\",\"a\",\"b\",\"c\"]}"},"fields":{"title":"Whole-Word Membership Uses a Sufficient Complete Length Slice","stem":"Use alphabet=[a, b, c] and typed regular-expression AST={\"type\":\"union\",\"children\":[{\"type\":\"union\",\"children\":[{\"type\":\"concat\",\"children\":[{\"type\":\"symbol\",\"value\":\"c\"},{\"type\":\"symbol\",\"value\":\"a\"},{\"type\":\"symbol\",\"value\":\"b\"},{\"type\":\"symbol\",\"value\":\"c\"},{\"type\":\"symbol\",\"value\":\"a\"}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"a\"}}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"b\"}}]}. Words are arrays of alphabet symbols; distinguish empty language from the language containing the empty word. Decide word=[c, a, b, c]. Give (alphabet, canonical_typed_AST, word, member, accepted_words_at_same_length, membership_scope).","answer":{"kind":"expression","value":"([a, b, c], {children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"}, [c, a, b, c], No, [[a, a, a, a], [b, b, b, b]], complete_membership_not_absence_from_an_insufficient_bound)","explanation":"Compute membership at exactly this word length, with a complete accepted-word slice for that length. Do not infer nonmembership merely because an insufficient shorter bound omitted the word. [] is an empty word when used as a word, while [] as a language contains no words. The exact result, retaining the requested order, is ([a, b, c], {children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"}, [c, a, b, c], No, [[a, a, a, a], [b, b, b, b]], complete_membership_not_absence_from_an_insufficient_bound)."},"skills":["Whole-Word Membership Uses a Sufficient Complete Length Slice"],"verification_warning":"This is a candidate exercise. Mechanical recomputation checks only the stated conditions and this instance; it is neither a formal proof nor human review."}}
{"schema_version":"ocme-question-localization-v0.1","question_id":"q-20261015-advance-20261118-r06-regular-expression-0066","batch_id":"batch-20261015-advance-20261118-r06-regular-expression-foundations","locale":"en","translation_state":"ai_candidate","source":{"question_sha256":"58e1e45b0ada4900a3e04c6eb36ca0e1ccaa767c61cc7ad781cb21a72a218af8","family_id":"qf-mod49-regex-word-membership","seed":202611186066,"semantic_template":"regex-word-membership|{alphabet:[\"a\",\"b\",\"c\"],regex:{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{type:\"symbol\",value:\"a\"}],type:\"union\"}],type:\"union\"}],type:\"union\"},word:[]}"},"fields":{"title":"Whole-Word Membership Uses a Sufficient Complete Length Slice","stem":"Use alphabet=[a, b, c] and typed regular-expression AST={\"type\":\"union\",\"children\":[{\"type\":\"union\",\"children\":[{\"type\":\"union\",\"children\":[{\"type\":\"symbol\",\"value\":\"a\"},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"b\"}}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"c\"}}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"a\"}}]}. Words are arrays of alphabet symbols; distinguish empty language from the language containing the empty word. Decide word=[]. Give (alphabet, canonical_typed_AST, word, member, accepted_words_at_same_length, membership_scope).","answer":{"kind":"expression","value":"([a, b, c], {children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{type:\"symbol\",value:\"a\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}, [], Yes, [[]], complete_membership_not_absence_from_an_insufficient_bound)","explanation":"Compute membership at exactly this word length, with a complete accepted-word slice for that length. Do not infer nonmembership merely because an insufficient shorter bound omitted the word. [] is an empty word when used as a word, while [] as a language contains no words. The exact result, retaining the requested order, is ([a, b, c], {children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{type:\"symbol\",value:\"a\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}, [], Yes, [[]], complete_membership_not_absence_from_an_insufficient_bound)."},"skills":["Whole-Word Membership Uses a Sufficient Complete Length Slice"],"verification_warning":"This is a candidate exercise. Mechanical recomputation checks only the stated conditions and this instance; it is neither a formal proof nor human review."}}
{"schema_version":"ocme-question-localization-v0.1","question_id":"q-20261015-advance-20261118-r06-regular-expression-0067","batch_id":"batch-20261015-advance-20261118-r06-regular-expression-foundations","locale":"en","translation_state":"ai_candidate","source":{"question_sha256":"07085b13f9bbd60f9f026672a422bd55ba13504679f28abd0d198d1a721ea8af","family_id":"qf-mod49-regex-word-membership","seed":202611186067,"semantic_template":"regex-word-membership|{alphabet:[\"a\",\"b\",\"c\"],regex:{children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"}],type:\"union\"},word:[\"b\"]}"},"fields":{"title":"Whole-Word Membership Uses a Sufficient Complete Length Slice","stem":"Use alphabet=[a, b, c] and typed regular-expression AST={\"type\":\"union\",\"children\":[{\"type\":\"union\",\"children\":[{\"type\":\"union\",\"children\":[{\"type\":\"concat\",\"children\":[{\"type\":\"symbol\",\"value\":\"b\"},{\"type\":\"symbol\",\"value\":\"c\"}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"c\"}}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"a\"}}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"b\"}}]}. Words are arrays of alphabet symbols; distinguish empty language from the language containing the empty word. Decide word=[b]. Give (alphabet, canonical_typed_AST, word, member, accepted_words_at_same_length, membership_scope).","answer":{"kind":"expression","value":"([a, b, c], {children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}, [b], Yes, [[a], [b], [c]], complete_membership_not_absence_from_an_insufficient_bound)","explanation":"Compute membership at exactly this word length, with a complete accepted-word slice for that length. Do not infer nonmembership merely because an insufficient shorter bound omitted the word. [] is an empty word when used as a word, while [] as a language contains no words. The exact result, retaining the requested order, is ([a, b, c], {children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}, [b], Yes, [[a], [b], [c]], complete_membership_not_absence_from_an_insufficient_bound)."},"skills":["Whole-Word Membership Uses a Sufficient Complete Length Slice"],"verification_warning":"This is a candidate exercise. Mechanical recomputation checks only the stated conditions and this instance; it is neither a formal proof nor human review."}}
{"schema_version":"ocme-question-localization-v0.1","question_id":"q-20261015-advance-20261118-r06-regular-expression-0068","batch_id":"batch-20261015-advance-20261118-r06-regular-expression-foundations","locale":"en","translation_state":"ai_candidate","source":{"question_sha256":"d5b7d895eb5647fefe49e062f8bca0f10a5067fc5ee0d106d3834b17a01cef35","family_id":"qf-mod49-regex-word-membership","seed":202611186068,"semantic_template":"regex-word-membership|{alphabet:[\"a\",\"b\",\"c\"],regex:{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"}],type:\"union\"},word:[\"c\",\"a\"]}"},"fields":{"title":"Whole-Word Membership Uses a Sufficient Complete Length Slice","stem":"Use alphabet=[a, b, c] and typed regular-expression AST={\"type\":\"union\",\"children\":[{\"type\":\"union\",\"children\":[{\"type\":\"union\",\"children\":[{\"type\":\"concat\",\"children\":[{\"type\":\"symbol\",\"value\":\"c\"},{\"type\":\"symbol\",\"value\":\"a\"},{\"type\":\"symbol\",\"value\":\"b\"}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"a\"}}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"b\"}}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"c\"}}]}. Words are arrays of alphabet symbols; distinguish empty language from the language containing the empty word. Decide word=[c, a]. Give (alphabet, canonical_typed_AST, word, member, accepted_words_at_same_length, membership_scope).","answer":{"kind":"expression","value":"([a, b, c], {children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}, [c, a], No, [[a, a], [b, b], [c, c]], complete_membership_not_absence_from_an_insufficient_bound)","explanation":"Compute membership at exactly this word length, with a complete accepted-word slice for that length. Do not infer nonmembership merely because an insufficient shorter bound omitted the word. [] is an empty word when used as a word, while [] as a language contains no words. The exact result, retaining the requested order, is ([a, b, c], {children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}, [c, a], No, [[a, a], [b, b], [c, c]], complete_membership_not_absence_from_an_insufficient_bound)."},"skills":["Whole-Word Membership Uses a Sufficient Complete Length Slice"],"verification_warning":"This is a candidate exercise. Mechanical recomputation checks only the stated conditions and this instance; it is neither a formal proof nor human review."}}
{"schema_version":"ocme-question-localization-v0.1","question_id":"q-20261015-advance-20261118-r06-regular-expression-0069","batch_id":"batch-20261015-advance-20261118-r06-regular-expression-foundations","locale":"en","translation_state":"ai_candidate","source":{"question_sha256":"3a8e2cdd453462db615c6d9d4cff741077b5c604fa115a2b3d3dfb2c6cee8470","family_id":"qf-mod49-regex-word-membership","seed":202611186069,"semantic_template":"regex-word-membership|{alphabet:[\"a\",\"b\",\"c\"],regex:{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"}],type:\"union\"},word:[\"a\",\"b\",\"c\"]}"},"fields":{"title":"Whole-Word Membership Uses a Sufficient Complete Length Slice","stem":"Use alphabet=[a, b, c] and typed regular-expression AST={\"type\":\"union\",\"children\":[{\"type\":\"union\",\"children\":[{\"type\":\"union\",\"children\":[{\"type\":\"concat\",\"children\":[{\"type\":\"symbol\",\"value\":\"a\"},{\"type\":\"symbol\",\"value\":\"b\"},{\"type\":\"symbol\",\"value\":\"c\"},{\"type\":\"symbol\",\"value\":\"a\"}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"b\"}}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"c\"}}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"a\"}}]}. Words are arrays of alphabet symbols; distinguish empty language from the language containing the empty word. Decide word=[a, b, c]. Give (alphabet, canonical_typed_AST, word, member, accepted_words_at_same_length, membership_scope).","answer":{"kind":"expression","value":"([a, b, c], {children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}, [a, b, c], No, [[a, a, a], [b, b, b], [c, c, c]], complete_membership_not_absence_from_an_insufficient_bound)","explanation":"Compute membership at exactly this word length, with a complete accepted-word slice for that length. Do not infer nonmembership merely because an insufficient shorter bound omitted the word. [] is an empty word when used as a word, while [] as a language contains no words. The exact result, retaining the requested order, is ([a, b, c], {children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}, [a, b, c], No, [[a, a, a], [b, b, b], [c, c, c]], complete_membership_not_absence_from_an_insufficient_bound)."},"skills":["Whole-Word Membership Uses a Sufficient Complete Length Slice"],"verification_warning":"This is a candidate exercise. Mechanical recomputation checks only the stated conditions and this instance; it is neither a formal proof nor human review."}}
{"schema_version":"ocme-question-localization-v0.1","question_id":"q-20261015-advance-20261118-r06-regular-expression-0070","batch_id":"batch-20261015-advance-20261118-r06-regular-expression-foundations","locale":"en","translation_state":"ai_candidate","source":{"question_sha256":"b37eca84f192227d36aa6123b43e12d0ff1fef87a11e739a3099d7c36b436a78","family_id":"qf-mod49-regex-word-membership","seed":202611186070,"semantic_template":"regex-word-membership|{alphabet:[\"a\",\"b\",\"c\"],regex:{children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"}],type:\"union\"},word:[\"b\",\"c\",\"a\",\"b\"]}"},"fields":{"title":"Whole-Word Membership Uses a Sufficient Complete Length Slice","stem":"Use alphabet=[a, b, c] and typed regular-expression AST={\"type\":\"union\",\"children\":[{\"type\":\"union\",\"children\":[{\"type\":\"union\",\"children\":[{\"type\":\"concat\",\"children\":[{\"type\":\"symbol\",\"value\":\"b\"},{\"type\":\"symbol\",\"value\":\"c\"},{\"type\":\"symbol\",\"value\":\"a\"},{\"type\":\"symbol\",\"value\":\"b\"},{\"type\":\"symbol\",\"value\":\"c\"}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"c\"}}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"a\"}}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"b\"}}]}. Words are arrays of alphabet symbols; distinguish empty language from the language containing the empty word. Decide word=[b, c, a, b]. Give (alphabet, canonical_typed_AST, word, member, accepted_words_at_same_length, membership_scope).","answer":{"kind":"expression","value":"([a, b, c], {children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}, [b, c, a, b], No, [[a, a, a, a], [b, b, b, b], [c, c, c, c]], complete_membership_not_absence_from_an_insufficient_bound)","explanation":"Compute membership at exactly this word length, with a complete accepted-word slice for that length. Do not infer nonmembership merely because an insufficient shorter bound omitted the word. [] is an empty word when used as a word, while [] as a language contains no words. The exact result, retaining the requested order, is ([a, b, c], {children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}, [b, c, a, b], No, [[a, a, a, a], [b, b, b, b], [c, c, c, c]], complete_membership_not_absence_from_an_insufficient_bound)."},"skills":["Whole-Word Membership Uses a Sufficient Complete Length Slice"],"verification_warning":"This is a candidate exercise. Mechanical recomputation checks only the stated conditions and this instance; it is neither a formal proof nor human review."}}
{"schema_version":"ocme-question-localization-v0.1","question_id":"q-20261015-advance-20261118-r06-regular-expression-0071","batch_id":"batch-20261015-advance-20261118-r06-regular-expression-foundations","locale":"en","translation_state":"ai_candidate","source":{"question_sha256":"deb523da73c30ac635a4259e194492ebd66c8781358b7e20b7663a415c08fa89","family_id":"qf-mod49-regex-word-membership","seed":202611186071,"semantic_template":"regex-word-membership|{alphabet:[\"a\",\"b\",\"c\"],regex:{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{type:\"symbol\",value:\"c\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}],type:\"union\"},word:[]}"},"fields":{"title":"Whole-Word Membership Uses a Sufficient Complete Length Slice","stem":"Use alphabet=[a, b, c] and typed regular-expression AST={\"type\":\"union\",\"children\":[{\"type\":\"union\",\"children\":[{\"type\":\"union\",\"children\":[{\"type\":\"union\",\"children\":[{\"type\":\"symbol\",\"value\":\"c\"},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"a\"}}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"b\"}}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"c\"}}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"a\"}}]}. Words are arrays of alphabet symbols; distinguish empty language from the language containing the empty word. Decide word=[]. Give (alphabet, canonical_typed_AST, word, member, accepted_words_at_same_length, membership_scope).","answer":{"kind":"expression","value":"([a, b, c], {children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{type:\"symbol\",value:\"c\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}, [], Yes, [[]], complete_membership_not_absence_from_an_insufficient_bound)","explanation":"Compute membership at exactly this word length, with a complete accepted-word slice for that length. Do not infer nonmembership merely because an insufficient shorter bound omitted the word. [] is an empty word when used as a word, while [] as a language contains no words. The exact result, retaining the requested order, is ([a, b, c], {children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{type:\"symbol\",value:\"c\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}, [], Yes, [[]], complete_membership_not_absence_from_an_insufficient_bound)."},"skills":["Whole-Word Membership Uses a Sufficient Complete Length Slice"],"verification_warning":"This is a candidate exercise. Mechanical recomputation checks only the stated conditions and this instance; it is neither a formal proof nor human review."}}
{"schema_version":"ocme-question-localization-v0.1","question_id":"q-20261015-advance-20261118-r06-regular-expression-0072","batch_id":"batch-20261015-advance-20261118-r06-regular-expression-foundations","locale":"en","translation_state":"ai_candidate","source":{"question_sha256":"20946db917af0cf4f0b220056d1c58234a43f009283672caa0cade23d594be21","family_id":"qf-mod49-regex-word-membership","seed":202611186072,"semantic_template":"regex-word-membership|{alphabet:[\"a\",\"b\",\"c\"],regex:{children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}],type:\"union\"},word:[\"a\"]}"},"fields":{"title":"Whole-Word Membership Uses a Sufficient Complete Length Slice","stem":"Use alphabet=[a, b, c] and typed regular-expression AST={\"type\":\"union\",\"children\":[{\"type\":\"union\",\"children\":[{\"type\":\"union\",\"children\":[{\"type\":\"union\",\"children\":[{\"type\":\"concat\",\"children\":[{\"type\":\"symbol\",\"value\":\"a\"},{\"type\":\"symbol\",\"value\":\"b\"}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"b\"}}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"c\"}}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"a\"}}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"b\"}}]}. Words are arrays of alphabet symbols; distinguish empty language from the language containing the empty word. Decide word=[a]. Give (alphabet, canonical_typed_AST, word, member, accepted_words_at_same_length, membership_scope).","answer":{"kind":"expression","value":"([a, b, c], {children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}, [a], Yes, [[a], [b], [c]], complete_membership_not_absence_from_an_insufficient_bound)","explanation":"Compute membership at exactly this word length, with a complete accepted-word slice for that length. Do not infer nonmembership merely because an insufficient shorter bound omitted the word. [] is an empty word when used as a word, while [] as a language contains no words. The exact result, retaining the requested order, is ([a, b, c], {children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}, [a], Yes, [[a], [b], [c]], complete_membership_not_absence_from_an_insufficient_bound)."},"skills":["Whole-Word Membership Uses a Sufficient Complete Length Slice"],"verification_warning":"This is a candidate exercise. Mechanical recomputation checks only the stated conditions and this instance; it is neither a formal proof nor human review."}}
{"schema_version":"ocme-question-localization-v0.1","question_id":"q-20261015-advance-20261118-r06-regular-expression-0073","batch_id":"batch-20261015-advance-20261118-r06-regular-expression-foundations","locale":"en","translation_state":"ai_candidate","source":{"question_sha256":"ff0e279925f1c200dd8ed710781ec5c71c17983e0636a9e560ed6a75681cf42f","family_id":"qf-mod49-regex-word-membership","seed":202611186073,"semantic_template":"regex-word-membership|{alphabet:[\"a\",\"b\",\"c\"],regex:{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}],type:\"union\"},word:[\"b\",\"c\"]}"},"fields":{"title":"Whole-Word Membership Uses a Sufficient Complete Length Slice","stem":"Use alphabet=[a, b, c] and typed regular-expression AST={\"type\":\"union\",\"children\":[{\"type\":\"union\",\"children\":[{\"type\":\"union\",\"children\":[{\"type\":\"union\",\"children\":[{\"type\":\"concat\",\"children\":[{\"type\":\"symbol\",\"value\":\"b\"},{\"type\":\"symbol\",\"value\":\"c\"},{\"type\":\"symbol\",\"value\":\"a\"}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"c\"}}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"a\"}}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"b\"}}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"c\"}}]}. Words are arrays of alphabet symbols; distinguish empty language from the language containing the empty word. Decide word=[b, c]. Give (alphabet, canonical_typed_AST, word, member, accepted_words_at_same_length, membership_scope).","answer":{"kind":"expression","value":"([a, b, c], {children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}, [b, c], No, [[a, a], [b, b], [c, c]], complete_membership_not_absence_from_an_insufficient_bound)","explanation":"Compute membership at exactly this word length, with a complete accepted-word slice for that length. Do not infer nonmembership merely because an insufficient shorter bound omitted the word. [] is an empty word when used as a word, while [] as a language contains no words. The exact result, retaining the requested order, is ([a, b, c], {children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}, [b, c], No, [[a, a], [b, b], [c, c]], complete_membership_not_absence_from_an_insufficient_bound)."},"skills":["Whole-Word Membership Uses a Sufficient Complete Length Slice"],"verification_warning":"This is a candidate exercise. Mechanical recomputation checks only the stated conditions and this instance; it is neither a formal proof nor human review."}}
{"schema_version":"ocme-question-localization-v0.1","question_id":"q-20261015-advance-20261118-r06-regular-expression-0074","batch_id":"batch-20261015-advance-20261118-r06-regular-expression-foundations","locale":"en","translation_state":"ai_candidate","source":{"question_sha256":"ad200c983755ac7d9cb20b60fd43934827855ac10a6ce11c1ca09e7b199827db","family_id":"qf-mod49-regex-word-membership","seed":202611186074,"semantic_template":"regex-word-membership|{alphabet:[\"a\",\"b\",\"c\"],regex:{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}],type:\"union\"},word:[\"c\",\"a\",\"b\"]}"},"fields":{"title":"Whole-Word Membership Uses a Sufficient Complete Length Slice","stem":"Use alphabet=[a, b, c] and typed regular-expression AST={\"type\":\"union\",\"children\":[{\"type\":\"union\",\"children\":[{\"type\":\"union\",\"children\":[{\"type\":\"union\",\"children\":[{\"type\":\"concat\",\"children\":[{\"type\":\"symbol\",\"value\":\"c\"},{\"type\":\"symbol\",\"value\":\"a\"},{\"type\":\"symbol\",\"value\":\"b\"},{\"type\":\"symbol\",\"value\":\"c\"}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"a\"}}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"b\"}}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"c\"}}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"a\"}}]}. Words are arrays of alphabet symbols; distinguish empty language from the language containing the empty word. Decide word=[c, a, b]. Give (alphabet, canonical_typed_AST, word, member, accepted_words_at_same_length, membership_scope).","answer":{"kind":"expression","value":"([a, b, c], {children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}, [c, a, b], No, [[a, a, a], [b, b, b], [c, c, c]], complete_membership_not_absence_from_an_insufficient_bound)","explanation":"Compute membership at exactly this word length, with a complete accepted-word slice for that length. Do not infer nonmembership merely because an insufficient shorter bound omitted the word. [] is an empty word when used as a word, while [] as a language contains no words. The exact result, retaining the requested order, is ([a, b, c], {children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}, [c, a, b], No, [[a, a, a], [b, b, b], [c, c, c]], complete_membership_not_absence_from_an_insufficient_bound)."},"skills":["Whole-Word Membership Uses a Sufficient Complete Length Slice"],"verification_warning":"This is a candidate exercise. Mechanical recomputation checks only the stated conditions and this instance; it is neither a formal proof nor human review."}}
{"schema_version":"ocme-question-localization-v0.1","question_id":"q-20261015-advance-20261118-r06-regular-expression-0075","batch_id":"batch-20261015-advance-20261118-r06-regular-expression-foundations","locale":"en","translation_state":"ai_candidate","source":{"question_sha256":"c1040e6201bdea88fd4d1c9955be6e50f39ca04c3eee97f8ca9000d4478bea37","family_id":"qf-mod49-regex-word-membership","seed":202611186075,"semantic_template":"regex-word-membership|{alphabet:[\"a\",\"b\",\"c\"],regex:{children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}],type:\"union\"},word:[\"a\",\"b\",\"c\",\"a\"]}"},"fields":{"title":"Whole-Word Membership Uses a Sufficient Complete Length Slice","stem":"Use alphabet=[a, b, c] and typed regular-expression AST={\"type\":\"union\",\"children\":[{\"type\":\"union\",\"children\":[{\"type\":\"union\",\"children\":[{\"type\":\"union\",\"children\":[{\"type\":\"concat\",\"children\":[{\"type\":\"symbol\",\"value\":\"a\"},{\"type\":\"symbol\",\"value\":\"b\"},{\"type\":\"symbol\",\"value\":\"c\"},{\"type\":\"symbol\",\"value\":\"a\"},{\"type\":\"symbol\",\"value\":\"b\"}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"b\"}}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"c\"}}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"a\"}}]},{\"type\":\"star\",\"child\":{\"type\":\"symbol\",\"value\":\"b\"}}]}. Words are arrays of alphabet symbols; distinguish empty language from the language containing the empty word. Decide word=[a, b, c, a]. Give (alphabet, canonical_typed_AST, word, member, accepted_words_at_same_length, membership_scope).","answer":{"kind":"expression","value":"([a, b, c], {children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}, [a, b, c, a], No, [[a, a, a, a], [b, b, b, b], [c, c, c, c]], complete_membership_not_absence_from_an_insufficient_bound)","explanation":"Compute membership at exactly this word length, with a complete accepted-word slice for that length. Do not infer nonmembership merely because an insufficient shorter bound omitted the word. [] is an empty word when used as a word, while [] as a language contains no words. The exact result, retaining the requested order, is ([a, b, c], {children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"a\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"c\"},type:\"star\"},{children:[{child:{type:\"symbol\",value:\"b\"},type:\"star\"},{children:[{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"}],type:\"concat\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}],type:\"union\"}, [a, b, c, a], No, [[a, a, a, a], [b, b, b, b], [c, c, c, c]], complete_membership_not_absence_from_an_insufficient_bound)."},"skills":["Whole-Word Membership Uses a Sufficient Complete Length Slice"],"verification_warning":"This is a candidate exercise. Mechanical recomputation checks only the stated conditions and this instance; it is neither a formal proof nor human review."}}
{"schema_version":"ocme-question-localization-v0.1","question_id":"q-20261015-advance-20261118-r06-regular-expression-0076","batch_id":"batch-20261015-advance-20261118-r06-regular-expression-foundations","locale":"en","translation_state":"ai_candidate","source":{"question_sha256":"dd6f1ad6b0ec6a8f7d43c7dceedf952c3b5a8c16a3b54c69616683755c013a4d","family_id":"qf-mod49-regex-boundary","seed":202611186076,"semantic_template":"regex-boundary|{mode:\"empty_vs_epsilon\",model:{alphabet:[]}}"},"fields":{"title":"Empty Language, Epsilon, Wildcards and Bounded Equality Are Not Interchangeable","stem":"Use mode=empty_vs_epsilon, complete model={\"alphabet\":[]}. Give (mode, alphabet, empty_language, epsilon_language, language_identity_claim, boundary).","answer":{"kind":"expression","value":"(empty_vs_epsilon, [], [], [[]], No, empty_language_not_language_containing_empty_word)","explanation":"empty_vs_epsilon separates [] from[[]]. A wildcard token is not a core typed AST node. bounded_equality retains equality through the bound and a genuine distinguishing next-length slice, so unbounded equivalence is No. concat_order retains the ordered ASTs and their genuinely different bounded languages. The exact result, retaining the requested order, is (empty_vs_epsilon, [], [], [[]], No, empty_language_not_language_containing_empty_word)."},"skills":["Empty Language, Epsilon, Wildcards and Bounded Equality Are Not Interchangeable"],"verification_warning":"This is a candidate exercise. Mechanical recomputation checks only the stated conditions and this instance; it is neither a formal proof nor human review."}}
{"schema_version":"ocme-question-localization-v0.1","question_id":"q-20261015-advance-20261118-r06-regular-expression-0077","batch_id":"batch-20261015-advance-20261118-r06-regular-expression-foundations","locale":"en","translation_state":"ai_candidate","source":{"question_sha256":"1bf9a36c02a698356bf160b2af96d1fe8cbe5462a50e0a69e732faf52053d3aa","family_id":"qf-mod49-regex-boundary","seed":202611186077,"semantic_template":"regex-boundary|{mode:\"wildcard_confusion\",model:{alphabet:[\"a\",\"b\"],token:\"*\"}}"},"fields":{"title":"Empty Language, Epsilon, Wildcards and Bounded Equality Are Not Interchangeable","stem":"Use mode=wildcard_confusion, complete model={\"alphabet\":[\"a\",\"b\"],\"token\":\"*\"}. Give (mode, alphabet, wildcard_token, core_AST_node_qualification, boundary).","answer":{"kind":"expression","value":"(wildcard_confusion, [a, b], *, No, shell_wildcard_is_not_a_core_regex_AST_node)","explanation":"empty_vs_epsilon separates [] from[[]]. A wildcard token is not a core typed AST node. bounded_equality retains equality through the bound and a genuine distinguishing next-length slice, so unbounded equivalence is No. concat_order retains the ordered ASTs and their genuinely different bounded languages. The exact result, retaining the requested order, is (wildcard_confusion, [a, b], *, No, shell_wildcard_is_not_a_core_regex_AST_node)."},"skills":["Empty Language, Epsilon, Wildcards and Bounded Equality Are Not Interchangeable"],"verification_warning":"This is a candidate exercise. Mechanical recomputation checks only the stated conditions and this instance; it is neither a formal proof nor human review."}}
{"schema_version":"ocme-question-localization-v0.1","question_id":"q-20261015-advance-20261118-r06-regular-expression-0078","batch_id":"batch-20261015-advance-20261118-r06-regular-expression-foundations","locale":"en","translation_state":"ai_candidate","source":{"question_sha256":"040c449a99482b9cc9599776b435f9a4dc97cfa4339d6ae9b523e5ffa1f701d3","family_id":"qf-mod49-regex-boundary","seed":202611186078,"semantic_template":"regex-boundary|{mode:\"wildcard_confusion\",model:{alphabet:[\"a\",\"b\"],token:\"?\"}}"},"fields":{"title":"Empty Language, Epsilon, Wildcards and Bounded Equality Are Not Interchangeable","stem":"Use mode=wildcard_confusion, complete model={\"alphabet\":[\"a\",\"b\"],\"token\":\"?\"}. Give (mode, alphabet, wildcard_token, core_AST_node_qualification, boundary).","answer":{"kind":"expression","value":"(wildcard_confusion, [a, b], ?, No, shell_wildcard_is_not_a_core_regex_AST_node)","explanation":"empty_vs_epsilon separates [] from[[]]. A wildcard token is not a core typed AST node. bounded_equality retains equality through the bound and a genuine distinguishing next-length slice, so unbounded equivalence is No. concat_order retains the ordered ASTs and their genuinely different bounded languages. The exact result, retaining the requested order, is (wildcard_confusion, [a, b], ?, No, shell_wildcard_is_not_a_core_regex_AST_node)."},"skills":["Empty Language, Epsilon, Wildcards and Bounded Equality Are Not Interchangeable"],"verification_warning":"This is a candidate exercise. Mechanical recomputation checks only the stated conditions and this instance; it is neither a formal proof nor human review."}}
{"schema_version":"ocme-question-localization-v0.1","question_id":"q-20261015-advance-20261118-r06-regular-expression-0079","batch_id":"batch-20261015-advance-20261118-r06-regular-expression-foundations","locale":"en","translation_state":"ai_candidate","source":{"question_sha256":"f611775611c437300ce66596e559c9b4e89b13b46c006de660c2c71823a40e3c","family_id":"qf-mod49-regex-boundary","seed":202611186079,"semantic_template":"regex-boundary|{mode:\"bounded_equality\",model:{alphabet:[\"a\"],left:{type:\"epsilon\"},max_length:1,right:{children:[{children:[{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"a\"}],type:\"concat\"},{type:\"epsilon\"}],type:\"union\"}}}"},"fields":{"title":"Empty Language, Epsilon, Wildcards and Bounded Equality Are Not Interchangeable","stem":"Use mode=bounded_equality, complete model={\"alphabet\":[\"a\"],\"left\":{\"type\":\"epsilon\"},\"right\":{\"type\":\"union\",\"children\":[{\"type\":\"epsilon\"},{\"type\":\"concat\",\"children\":[{\"type\":\"symbol\",\"value\":\"a\"},{\"type\":\"symbol\",\"value\":\"a\"}]}]},\"max_length\":1}. Give (mode, bound, left_bounded_language, right_bounded_language, equal_through_bound, next_bound, left_next_language, right_next_language, differs_at_next_bound, unbounded_equivalence_claim, boundary).","answer":{"kind":"expression","value":"(bounded_equality, 1, [[]], [[]], Yes, 2, [[]], [[], [a, a]], Yes, No, bounded_language_equality_does_not_prove_regex_equivalence)","explanation":"empty_vs_epsilon separates [] from[[]]. A wildcard token is not a core typed AST node. bounded_equality retains equality through the bound and a genuine distinguishing next-length slice, so unbounded equivalence is No. concat_order retains the ordered ASTs and their genuinely different bounded languages. The exact result, retaining the requested order, is (bounded_equality, 1, [[]], [[]], Yes, 2, [[]], [[], [a, a]], Yes, No, bounded_language_equality_does_not_prove_regex_equivalence)."},"skills":["Empty Language, Epsilon, Wildcards and Bounded Equality Are Not Interchangeable"],"verification_warning":"This is a candidate exercise. Mechanical recomputation checks only the stated conditions and this instance; it is neither a formal proof nor human review."}}
{"schema_version":"ocme-question-localization-v0.1","question_id":"q-20261015-advance-20261118-r06-regular-expression-0080","batch_id":"batch-20261015-advance-20261118-r06-regular-expression-foundations","locale":"en","translation_state":"ai_candidate","source":{"question_sha256":"41086e4e8fa855818b52ea3bfe6f1157105f53144c7dce9c23d91d83b5dc4cf4","family_id":"qf-mod49-regex-boundary","seed":202611186080,"semantic_template":"regex-boundary|{mode:\"concat_order\",model:{alphabet:[\"a\",\"b\",\"c\"],left:{children:[{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"}],type:\"concat\"},max_length:2,right:{children:[{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"a\"}],type:\"concat\"}}}"},"fields":{"title":"Empty Language, Epsilon, Wildcards and Bounded Equality Are Not Interchangeable","stem":"Use mode=concat_order, complete model={\"alphabet\":[\"a\",\"b\",\"c\"],\"left\":{\"type\":\"concat\",\"children\":[{\"type\":\"symbol\",\"value\":\"a\"},{\"type\":\"symbol\",\"value\":\"b\"}]},\"right\":{\"type\":\"concat\",\"children\":[{\"type\":\"symbol\",\"value\":\"b\"},{\"type\":\"symbol\",\"value\":\"a\"}]},\"max_length\":2}. Give (mode, left_AST, right_AST, left_bounded_language, right_bounded_language, bounded_languages_equal, order_irrelevance_claim, boundary).","answer":{"kind":"expression","value":"(concat_order, {children:[{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"}],type:\"concat\"}, {children:[{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"a\"}],type:\"concat\"}, [[a, b]], [[b, a]], No, No, concatenation_order_is_semantic)","explanation":"empty_vs_epsilon separates [] from[[]]. A wildcard token is not a core typed AST node. bounded_equality retains equality through the bound and a genuine distinguishing next-length slice, so unbounded equivalence is No. concat_order retains the ordered ASTs and their genuinely different bounded languages. The exact result, retaining the requested order, is (concat_order, {children:[{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"}],type:\"concat\"}, {children:[{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"a\"}],type:\"concat\"}, [[a, b]], [[b, a]], No, No, concatenation_order_is_semantic)."},"skills":["Empty Language, Epsilon, Wildcards and Bounded Equality Are Not Interchangeable"],"verification_warning":"This is a candidate exercise. Mechanical recomputation checks only the stated conditions and this instance; it is neither a formal proof nor human review."}}
{"schema_version":"ocme-question-localization-v0.1","question_id":"q-20261015-advance-20261118-r06-regular-expression-0081","batch_id":"batch-20261015-advance-20261118-r06-regular-expression-foundations","locale":"en","translation_state":"ai_candidate","source":{"question_sha256":"a889b2aa86df5ccf3275ba568b23232af5313f7a37360e8ca0603f6a90749a20","family_id":"qf-mod49-regex-boundary","seed":202611186081,"semantic_template":"regex-boundary|{mode:\"bounded_equality\",model:{alphabet:[\"b\"],left:{type:\"epsilon\"},max_length:2,right:{children:[{children:[{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"b\"}],type:\"concat\"},{type:\"epsilon\"}],type:\"union\"}}}"},"fields":{"title":"Empty Language, Epsilon, Wildcards and Bounded Equality Are Not Interchangeable","stem":"Use mode=bounded_equality, complete model={\"alphabet\":[\"b\"],\"left\":{\"type\":\"epsilon\"},\"right\":{\"type\":\"union\",\"children\":[{\"type\":\"epsilon\"},{\"type\":\"concat\",\"children\":[{\"type\":\"symbol\",\"value\":\"b\"},{\"type\":\"symbol\",\"value\":\"b\"},{\"type\":\"symbol\",\"value\":\"b\"}]}]},\"max_length\":2}. Give (mode, bound, left_bounded_language, right_bounded_language, equal_through_bound, next_bound, left_next_language, right_next_language, differs_at_next_bound, unbounded_equivalence_claim, boundary).","answer":{"kind":"expression","value":"(bounded_equality, 2, [[]], [[]], Yes, 3, [[]], [[], [b, b, b]], Yes, No, bounded_language_equality_does_not_prove_regex_equivalence)","explanation":"empty_vs_epsilon separates [] from[[]]. A wildcard token is not a core typed AST node. bounded_equality retains equality through the bound and a genuine distinguishing next-length slice, so unbounded equivalence is No. concat_order retains the ordered ASTs and their genuinely different bounded languages. The exact result, retaining the requested order, is (bounded_equality, 2, [[]], [[]], Yes, 3, [[]], [[], [b, b, b]], Yes, No, bounded_language_equality_does_not_prove_regex_equivalence)."},"skills":["Empty Language, Epsilon, Wildcards and Bounded Equality Are Not Interchangeable"],"verification_warning":"This is a candidate exercise. Mechanical recomputation checks only the stated conditions and this instance; it is neither a formal proof nor human review."}}
{"schema_version":"ocme-question-localization-v0.1","question_id":"q-20261015-advance-20261118-r06-regular-expression-0082","batch_id":"batch-20261015-advance-20261118-r06-regular-expression-foundations","locale":"en","translation_state":"ai_candidate","source":{"question_sha256":"d48aca186263e00b936f12784061d73b9cde55147a0ead21f7bd4fadf163afe2","family_id":"qf-mod49-regex-boundary","seed":202611186082,"semantic_template":"regex-boundary|{mode:\"concat_order\",model:{alphabet:[\"a\",\"b\",\"c\"],left:{children:[{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"}],type:\"concat\"},max_length:3,right:{children:[{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"b\"}],type:\"concat\"}}}"},"fields":{"title":"Empty Language, Epsilon, Wildcards and Bounded Equality Are Not Interchangeable","stem":"Use mode=concat_order, complete model={\"alphabet\":[\"a\",\"b\",\"c\"],\"left\":{\"type\":\"concat\",\"children\":[{\"type\":\"symbol\",\"value\":\"b\"},{\"type\":\"symbol\",\"value\":\"b\"},{\"type\":\"symbol\",\"value\":\"c\"}]},\"right\":{\"type\":\"concat\",\"children\":[{\"type\":\"symbol\",\"value\":\"c\"},{\"type\":\"symbol\",\"value\":\"b\"},{\"type\":\"symbol\",\"value\":\"b\"}]},\"max_length\":3}. Give (mode, left_AST, right_AST, left_bounded_language, right_bounded_language, bounded_languages_equal, order_irrelevance_claim, boundary).","answer":{"kind":"expression","value":"(concat_order, {children:[{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"}],type:\"concat\"}, {children:[{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"b\"}],type:\"concat\"}, [[b, b, c]], [[c, b, b]], No, No, concatenation_order_is_semantic)","explanation":"empty_vs_epsilon separates [] from[[]]. A wildcard token is not a core typed AST node. bounded_equality retains equality through the bound and a genuine distinguishing next-length slice, so unbounded equivalence is No. concat_order retains the ordered ASTs and their genuinely different bounded languages. The exact result, retaining the requested order, is (concat_order, {children:[{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"}],type:\"concat\"}, {children:[{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"b\"}],type:\"concat\"}, [[b, b, c]], [[c, b, b]], No, No, concatenation_order_is_semantic)."},"skills":["Empty Language, Epsilon, Wildcards and Bounded Equality Are Not Interchangeable"],"verification_warning":"This is a candidate exercise. Mechanical recomputation checks only the stated conditions and this instance; it is neither a formal proof nor human review."}}
{"schema_version":"ocme-question-localization-v0.1","question_id":"q-20261015-advance-20261118-r06-regular-expression-0083","batch_id":"batch-20261015-advance-20261118-r06-regular-expression-foundations","locale":"en","translation_state":"ai_candidate","source":{"question_sha256":"d8db3f65b999e7c3130842dafc3d383aa0ec0e7afb693f12f6a9a08d01fa6fa1","family_id":"qf-mod49-regex-boundary","seed":202611186083,"semantic_template":"regex-boundary|{mode:\"bounded_equality\",model:{alphabet:[\"c\"],left:{type:\"epsilon\"},max_length:3,right:{children:[{children:[{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"c\"}],type:\"concat\"},{type:\"epsilon\"}],type:\"union\"}}}"},"fields":{"title":"Empty Language, Epsilon, Wildcards and Bounded Equality Are Not Interchangeable","stem":"Use mode=bounded_equality, complete model={\"alphabet\":[\"c\"],\"left\":{\"type\":\"epsilon\"},\"right\":{\"type\":\"union\",\"children\":[{\"type\":\"epsilon\"},{\"type\":\"concat\",\"children\":[{\"type\":\"symbol\",\"value\":\"c\"},{\"type\":\"symbol\",\"value\":\"c\"},{\"type\":\"symbol\",\"value\":\"c\"},{\"type\":\"symbol\",\"value\":\"c\"}]}]},\"max_length\":3}. Give (mode, bound, left_bounded_language, right_bounded_language, equal_through_bound, next_bound, left_next_language, right_next_language, differs_at_next_bound, unbounded_equivalence_claim, boundary).","answer":{"kind":"expression","value":"(bounded_equality, 3, [[]], [[]], Yes, 4, [[]], [[], [c, c, c, c]], Yes, No, bounded_language_equality_does_not_prove_regex_equivalence)","explanation":"empty_vs_epsilon separates [] from[[]]. A wildcard token is not a core typed AST node. bounded_equality retains equality through the bound and a genuine distinguishing next-length slice, so unbounded equivalence is No. concat_order retains the ordered ASTs and their genuinely different bounded languages. The exact result, retaining the requested order, is (bounded_equality, 3, [[]], [[]], Yes, 4, [[]], [[], [c, c, c, c]], Yes, No, bounded_language_equality_does_not_prove_regex_equivalence)."},"skills":["Empty Language, Epsilon, Wildcards and Bounded Equality Are Not Interchangeable"],"verification_warning":"This is a candidate exercise. Mechanical recomputation checks only the stated conditions and this instance; it is neither a formal proof nor human review."}}
{"schema_version":"ocme-question-localization-v0.1","question_id":"q-20261015-advance-20261118-r06-regular-expression-0084","batch_id":"batch-20261015-advance-20261118-r06-regular-expression-foundations","locale":"en","translation_state":"ai_candidate","source":{"question_sha256":"8d53ad65415db613fcc71a19f04f44aaad5ee885015210da6e30e3ced04691aa","family_id":"qf-mod49-regex-boundary","seed":202611186084,"semantic_template":"regex-boundary|{mode:\"concat_order\",model:{alphabet:[\"a\",\"b\",\"c\"],left:{children:[{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"}],type:\"concat\"},max_length:4,right:{children:[{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"c\"}],type:\"concat\"}}}"},"fields":{"title":"Empty Language, Epsilon, Wildcards and Bounded Equality Are Not Interchangeable","stem":"Use mode=concat_order, complete model={\"alphabet\":[\"a\",\"b\",\"c\"],\"left\":{\"type\":\"concat\",\"children\":[{\"type\":\"symbol\",\"value\":\"c\"},{\"type\":\"symbol\",\"value\":\"c\"},{\"type\":\"symbol\",\"value\":\"c\"},{\"type\":\"symbol\",\"value\":\"a\"}]},\"right\":{\"type\":\"concat\",\"children\":[{\"type\":\"symbol\",\"value\":\"a\"},{\"type\":\"symbol\",\"value\":\"c\"},{\"type\":\"symbol\",\"value\":\"c\"},{\"type\":\"symbol\",\"value\":\"c\"}]},\"max_length\":4}. Give (mode, left_AST, right_AST, left_bounded_language, right_bounded_language, bounded_languages_equal, order_irrelevance_claim, boundary).","answer":{"kind":"expression","value":"(concat_order, {children:[{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"}],type:\"concat\"}, {children:[{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"c\"}],type:\"concat\"}, [[c, c, c, a]], [[a, c, c, c]], No, No, concatenation_order_is_semantic)","explanation":"empty_vs_epsilon separates [] from[[]]. A wildcard token is not a core typed AST node. bounded_equality retains equality through the bound and a genuine distinguishing next-length slice, so unbounded equivalence is No. concat_order retains the ordered ASTs and their genuinely different bounded languages. The exact result, retaining the requested order, is (concat_order, {children:[{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"}],type:\"concat\"}, {children:[{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"c\"}],type:\"concat\"}, [[c, c, c, a]], [[a, c, c, c]], No, No, concatenation_order_is_semantic)."},"skills":["Empty Language, Epsilon, Wildcards and Bounded Equality Are Not Interchangeable"],"verification_warning":"This is a candidate exercise. Mechanical recomputation checks only the stated conditions and this instance; it is neither a formal proof nor human review."}}
{"schema_version":"ocme-question-localization-v0.1","question_id":"q-20261015-advance-20261118-r06-regular-expression-0085","batch_id":"batch-20261015-advance-20261118-r06-regular-expression-foundations","locale":"en","translation_state":"ai_candidate","source":{"question_sha256":"c28f65fb4100d1a4c3d7f9f80273672039f3d2385b95fa593e5fe99ab4a9933d","family_id":"qf-mod49-regex-boundary","seed":202611186085,"semantic_template":"regex-boundary|{mode:\"bounded_equality\",model:{alphabet:[\"a\"],left:{type:\"epsilon\"},max_length:4,right:{children:[{children:[{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"a\"}],type:\"concat\"},{type:\"epsilon\"}],type:\"union\"}}}"},"fields":{"title":"Empty Language, Epsilon, Wildcards and Bounded Equality Are Not Interchangeable","stem":"Use mode=bounded_equality, complete model={\"alphabet\":[\"a\"],\"left\":{\"type\":\"epsilon\"},\"right\":{\"type\":\"union\",\"children\":[{\"type\":\"epsilon\"},{\"type\":\"concat\",\"children\":[{\"type\":\"symbol\",\"value\":\"a\"},{\"type\":\"symbol\",\"value\":\"a\"},{\"type\":\"symbol\",\"value\":\"a\"},{\"type\":\"symbol\",\"value\":\"a\"},{\"type\":\"symbol\",\"value\":\"a\"}]}]},\"max_length\":4}. Give (mode, bound, left_bounded_language, right_bounded_language, equal_through_bound, next_bound, left_next_language, right_next_language, differs_at_next_bound, unbounded_equivalence_claim, boundary).","answer":{"kind":"expression","value":"(bounded_equality, 4, [[]], [[]], Yes, 5, [[]], [[], [a, a, a, a, a]], Yes, No, bounded_language_equality_does_not_prove_regex_equivalence)","explanation":"empty_vs_epsilon separates [] from[[]]. A wildcard token is not a core typed AST node. bounded_equality retains equality through the bound and a genuine distinguishing next-length slice, so unbounded equivalence is No. concat_order retains the ordered ASTs and their genuinely different bounded languages. The exact result, retaining the requested order, is (bounded_equality, 4, [[]], [[]], Yes, 5, [[]], [[], [a, a, a, a, a]], Yes, No, bounded_language_equality_does_not_prove_regex_equivalence)."},"skills":["Empty Language, Epsilon, Wildcards and Bounded Equality Are Not Interchangeable"],"verification_warning":"This is a candidate exercise. Mechanical recomputation checks only the stated conditions and this instance; it is neither a formal proof nor human review."}}
{"schema_version":"ocme-question-localization-v0.1","question_id":"q-20261015-advance-20261118-r06-regular-expression-0086","batch_id":"batch-20261015-advance-20261118-r06-regular-expression-foundations","locale":"en","translation_state":"ai_candidate","source":{"question_sha256":"8a7c5bab08752ec0f08dda55bec1a4ce936613e82569967e439cdb967c7d1e63","family_id":"qf-mod49-regex-boundary","seed":202611186086,"semantic_template":"regex-boundary|{mode:\"concat_order\",model:{alphabet:[\"a\",\"b\",\"c\"],left:{children:[{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"}],type:\"concat\"},max_length:5,right:{children:[{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"a\"}],type:\"concat\"}}}"},"fields":{"title":"Empty Language, Epsilon, Wildcards and Bounded Equality Are Not Interchangeable","stem":"Use mode=concat_order, complete model={\"alphabet\":[\"a\",\"b\",\"c\"],\"left\":{\"type\":\"concat\",\"children\":[{\"type\":\"symbol\",\"value\":\"a\"},{\"type\":\"symbol\",\"value\":\"a\"},{\"type\":\"symbol\",\"value\":\"a\"},{\"type\":\"symbol\",\"value\":\"a\"},{\"type\":\"symbol\",\"value\":\"b\"}]},\"right\":{\"type\":\"concat\",\"children\":[{\"type\":\"symbol\",\"value\":\"b\"},{\"type\":\"symbol\",\"value\":\"a\"},{\"type\":\"symbol\",\"value\":\"a\"},{\"type\":\"symbol\",\"value\":\"a\"},{\"type\":\"symbol\",\"value\":\"a\"}]},\"max_length\":5}. Give (mode, left_AST, right_AST, left_bounded_language, right_bounded_language, bounded_languages_equal, order_irrelevance_claim, boundary).","answer":{"kind":"expression","value":"(concat_order, {children:[{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"}],type:\"concat\"}, {children:[{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"a\"}],type:\"concat\"}, [[a, a, a, a, b]], [[b, a, a, a, a]], No, No, concatenation_order_is_semantic)","explanation":"empty_vs_epsilon separates [] from[[]]. A wildcard token is not a core typed AST node. bounded_equality retains equality through the bound and a genuine distinguishing next-length slice, so unbounded equivalence is No. concat_order retains the ordered ASTs and their genuinely different bounded languages. The exact result, retaining the requested order, is (concat_order, {children:[{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"}],type:\"concat\"}, {children:[{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"a\"}],type:\"concat\"}, [[a, a, a, a, b]], [[b, a, a, a, a]], No, No, concatenation_order_is_semantic)."},"skills":["Empty Language, Epsilon, Wildcards and Bounded Equality Are Not Interchangeable"],"verification_warning":"This is a candidate exercise. Mechanical recomputation checks only the stated conditions and this instance; it is neither a formal proof nor human review."}}
{"schema_version":"ocme-question-localization-v0.1","question_id":"q-20261015-advance-20261118-r06-regular-expression-0087","batch_id":"batch-20261015-advance-20261118-r06-regular-expression-foundations","locale":"en","translation_state":"ai_candidate","source":{"question_sha256":"573fab86b9c6c4f0010be4407a9b6f5dcb090e0422a7a0d4b76efe0fb07f35e2","family_id":"qf-mod49-regex-boundary","seed":202611186087,"semantic_template":"regex-boundary|{mode:\"bounded_equality\",model:{alphabet:[\"b\"],left:{type:\"epsilon\"},max_length:5,right:{children:[{children:[{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"b\"}],type:\"concat\"},{type:\"epsilon\"}],type:\"union\"}}}"},"fields":{"title":"Empty Language, Epsilon, Wildcards and Bounded Equality Are Not Interchangeable","stem":"Use mode=bounded_equality, complete model={\"alphabet\":[\"b\"],\"left\":{\"type\":\"epsilon\"},\"right\":{\"type\":\"union\",\"children\":[{\"type\":\"epsilon\"},{\"type\":\"concat\",\"children\":[{\"type\":\"symbol\",\"value\":\"b\"},{\"type\":\"symbol\",\"value\":\"b\"},{\"type\":\"symbol\",\"value\":\"b\"},{\"type\":\"symbol\",\"value\":\"b\"},{\"type\":\"symbol\",\"value\":\"b\"},{\"type\":\"symbol\",\"value\":\"b\"}]}]},\"max_length\":5}. Give (mode, bound, left_bounded_language, right_bounded_language, equal_through_bound, next_bound, left_next_language, right_next_language, differs_at_next_bound, unbounded_equivalence_claim, boundary).","answer":{"kind":"expression","value":"(bounded_equality, 5, [[]], [[]], Yes, 6, [[]], [[], [b, b, b, b, b, b]], Yes, No, bounded_language_equality_does_not_prove_regex_equivalence)","explanation":"empty_vs_epsilon separates [] from[[]]. A wildcard token is not a core typed AST node. bounded_equality retains equality through the bound and a genuine distinguishing next-length slice, so unbounded equivalence is No. concat_order retains the ordered ASTs and their genuinely different bounded languages. The exact result, retaining the requested order, is (bounded_equality, 5, [[]], [[]], Yes, 6, [[]], [[], [b, b, b, b, b, b]], Yes, No, bounded_language_equality_does_not_prove_regex_equivalence)."},"skills":["Empty Language, Epsilon, Wildcards and Bounded Equality Are Not Interchangeable"],"verification_warning":"This is a candidate exercise. Mechanical recomputation checks only the stated conditions and this instance; it is neither a formal proof nor human review."}}
{"schema_version":"ocme-question-localization-v0.1","question_id":"q-20261015-advance-20261118-r06-regular-expression-0088","batch_id":"batch-20261015-advance-20261118-r06-regular-expression-foundations","locale":"en","translation_state":"ai_candidate","source":{"question_sha256":"b6791a62b7c0ebc27b5076eff157011aec014ba948c628b8f146dc89a9c70d65","family_id":"qf-mod49-regex-boundary","seed":202611186088,"semantic_template":"regex-boundary|{mode:\"concat_order\",model:{alphabet:[\"a\",\"b\",\"c\"],left:{children:[{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"}],type:\"concat\"},max_length:2,right:{children:[{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"b\"}],type:\"concat\"}}}"},"fields":{"title":"Empty Language, Epsilon, Wildcards and Bounded Equality Are Not Interchangeable","stem":"Use mode=concat_order, complete model={\"alphabet\":[\"a\",\"b\",\"c\"],\"left\":{\"type\":\"concat\",\"children\":[{\"type\":\"symbol\",\"value\":\"b\"},{\"type\":\"symbol\",\"value\":\"c\"}]},\"right\":{\"type\":\"concat\",\"children\":[{\"type\":\"symbol\",\"value\":\"c\"},{\"type\":\"symbol\",\"value\":\"b\"}]},\"max_length\":2}. Give (mode, left_AST, right_AST, left_bounded_language, right_bounded_language, bounded_languages_equal, order_irrelevance_claim, boundary).","answer":{"kind":"expression","value":"(concat_order, {children:[{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"}],type:\"concat\"}, {children:[{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"b\"}],type:\"concat\"}, [[b, c]], [[c, b]], No, No, concatenation_order_is_semantic)","explanation":"empty_vs_epsilon separates [] from[[]]. A wildcard token is not a core typed AST node. bounded_equality retains equality through the bound and a genuine distinguishing next-length slice, so unbounded equivalence is No. concat_order retains the ordered ASTs and their genuinely different bounded languages. The exact result, retaining the requested order, is (concat_order, {children:[{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"}],type:\"concat\"}, {children:[{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"b\"}],type:\"concat\"}, [[b, c]], [[c, b]], No, No, concatenation_order_is_semantic)."},"skills":["Empty Language, Epsilon, Wildcards and Bounded Equality Are Not Interchangeable"],"verification_warning":"This is a candidate exercise. Mechanical recomputation checks only the stated conditions and this instance; it is neither a formal proof nor human review."}}
{"schema_version":"ocme-question-localization-v0.1","question_id":"q-20261015-advance-20261118-r06-regular-expression-0089","batch_id":"batch-20261015-advance-20261118-r06-regular-expression-foundations","locale":"en","translation_state":"ai_candidate","source":{"question_sha256":"3dd3de6ce7ab4056e237a481fff1805f6e6aba3172cf56e552cd20d488ccfce5","family_id":"qf-mod49-regex-boundary","seed":202611186089,"semantic_template":"regex-boundary|{mode:\"bounded_equality\",model:{alphabet:[\"c\"],left:{type:\"epsilon\"},max_length:6,right:{children:[{children:[{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"c\"}],type:\"concat\"},{type:\"epsilon\"}],type:\"union\"}}}"},"fields":{"title":"Empty Language, Epsilon, Wildcards and Bounded Equality Are Not Interchangeable","stem":"Use mode=bounded_equality, complete model={\"alphabet\":[\"c\"],\"left\":{\"type\":\"epsilon\"},\"right\":{\"type\":\"union\",\"children\":[{\"type\":\"epsilon\"},{\"type\":\"concat\",\"children\":[{\"type\":\"symbol\",\"value\":\"c\"},{\"type\":\"symbol\",\"value\":\"c\"},{\"type\":\"symbol\",\"value\":\"c\"},{\"type\":\"symbol\",\"value\":\"c\"},{\"type\":\"symbol\",\"value\":\"c\"},{\"type\":\"symbol\",\"value\":\"c\"},{\"type\":\"symbol\",\"value\":\"c\"}]}]},\"max_length\":6}. Give (mode, bound, left_bounded_language, right_bounded_language, equal_through_bound, next_bound, left_next_language, right_next_language, differs_at_next_bound, unbounded_equivalence_claim, boundary).","answer":{"kind":"expression","value":"(bounded_equality, 6, [[]], [[]], Yes, 7, [[]], [[], [c, c, c, c, c, c, c]], Yes, No, bounded_language_equality_does_not_prove_regex_equivalence)","explanation":"empty_vs_epsilon separates [] from[[]]. A wildcard token is not a core typed AST node. bounded_equality retains equality through the bound and a genuine distinguishing next-length slice, so unbounded equivalence is No. concat_order retains the ordered ASTs and their genuinely different bounded languages. The exact result, retaining the requested order, is (bounded_equality, 6, [[]], [[]], Yes, 7, [[]], [[], [c, c, c, c, c, c, c]], Yes, No, bounded_language_equality_does_not_prove_regex_equivalence)."},"skills":["Empty Language, Epsilon, Wildcards and Bounded Equality Are Not Interchangeable"],"verification_warning":"This is a candidate exercise. Mechanical recomputation checks only the stated conditions and this instance; it is neither a formal proof nor human review."}}
{"schema_version":"ocme-question-localization-v0.1","question_id":"q-20261015-advance-20261118-r06-regular-expression-0090","batch_id":"batch-20261015-advance-20261118-r06-regular-expression-foundations","locale":"en","translation_state":"ai_candidate","source":{"question_sha256":"fecf39b93cf3e8121263ec2a3f3f52225424a37c4e22c62833f112a980aa84c8","family_id":"qf-mod49-regex-boundary","seed":202611186090,"semantic_template":"regex-boundary|{mode:\"concat_order\",model:{alphabet:[\"a\",\"b\",\"c\"],left:{children:[{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"}],type:\"concat\"},max_length:3,right:{children:[{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"c\"}],type:\"concat\"}}}"},"fields":{"title":"Empty Language, Epsilon, Wildcards and Bounded Equality Are Not Interchangeable","stem":"Use mode=concat_order, complete model={\"alphabet\":[\"a\",\"b\",\"c\"],\"left\":{\"type\":\"concat\",\"children\":[{\"type\":\"symbol\",\"value\":\"c\"},{\"type\":\"symbol\",\"value\":\"c\"},{\"type\":\"symbol\",\"value\":\"a\"}]},\"right\":{\"type\":\"concat\",\"children\":[{\"type\":\"symbol\",\"value\":\"a\"},{\"type\":\"symbol\",\"value\":\"c\"},{\"type\":\"symbol\",\"value\":\"c\"}]},\"max_length\":3}. Give (mode, left_AST, right_AST, left_bounded_language, right_bounded_language, bounded_languages_equal, order_irrelevance_claim, boundary).","answer":{"kind":"expression","value":"(concat_order, {children:[{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"}],type:\"concat\"}, {children:[{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"c\"}],type:\"concat\"}, [[c, c, a]], [[a, c, c]], No, No, concatenation_order_is_semantic)","explanation":"empty_vs_epsilon separates [] from[[]]. A wildcard token is not a core typed AST node. bounded_equality retains equality through the bound and a genuine distinguishing next-length slice, so unbounded equivalence is No. concat_order retains the ordered ASTs and their genuinely different bounded languages. The exact result, retaining the requested order, is (concat_order, {children:[{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"}],type:\"concat\"}, {children:[{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"c\"}],type:\"concat\"}, [[c, c, a]], [[a, c, c]], No, No, concatenation_order_is_semantic)."},"skills":["Empty Language, Epsilon, Wildcards and Bounded Equality Are Not Interchangeable"],"verification_warning":"This is a candidate exercise. Mechanical recomputation checks only the stated conditions and this instance; it is neither a formal proof nor human review."}}
{"schema_version":"ocme-question-localization-v0.1","question_id":"q-20261015-advance-20261118-r06-regular-expression-0091","batch_id":"batch-20261015-advance-20261118-r06-regular-expression-foundations","locale":"en","translation_state":"ai_candidate","source":{"question_sha256":"b355fd6bce63c730d7cd801ef8382684f46bc05ffe79d3a6978b3156d4862cc1","family_id":"qf-mod49-regex-boundary","seed":202611186091,"semantic_template":"regex-boundary|{mode:\"bounded_equality\",model:{alphabet:[\"a\"],left:{type:\"epsilon\"},max_length:7,right:{children:[{children:[{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"a\"}],type:\"concat\"},{type:\"epsilon\"}],type:\"union\"}}}"},"fields":{"title":"Empty Language, Epsilon, Wildcards and Bounded Equality Are Not Interchangeable","stem":"Use mode=bounded_equality, complete model={\"alphabet\":[\"a\"],\"left\":{\"type\":\"epsilon\"},\"right\":{\"type\":\"union\",\"children\":[{\"type\":\"epsilon\"},{\"type\":\"concat\",\"children\":[{\"type\":\"symbol\",\"value\":\"a\"},{\"type\":\"symbol\",\"value\":\"a\"},{\"type\":\"symbol\",\"value\":\"a\"},{\"type\":\"symbol\",\"value\":\"a\"},{\"type\":\"symbol\",\"value\":\"a\"},{\"type\":\"symbol\",\"value\":\"a\"},{\"type\":\"symbol\",\"value\":\"a\"},{\"type\":\"symbol\",\"value\":\"a\"}]}]},\"max_length\":7}. Give (mode, bound, left_bounded_language, right_bounded_language, equal_through_bound, next_bound, left_next_language, right_next_language, differs_at_next_bound, unbounded_equivalence_claim, boundary).","answer":{"kind":"expression","value":"(bounded_equality, 7, [[]], [[]], Yes, 8, [[]], [[], [a, a, a, a, a, a, a, a]], Yes, No, bounded_language_equality_does_not_prove_regex_equivalence)","explanation":"empty_vs_epsilon separates [] from[[]]. A wildcard token is not a core typed AST node. bounded_equality retains equality through the bound and a genuine distinguishing next-length slice, so unbounded equivalence is No. concat_order retains the ordered ASTs and their genuinely different bounded languages. The exact result, retaining the requested order, is (bounded_equality, 7, [[]], [[]], Yes, 8, [[]], [[], [a, a, a, a, a, a, a, a]], Yes, No, bounded_language_equality_does_not_prove_regex_equivalence)."},"skills":["Empty Language, Epsilon, Wildcards and Bounded Equality Are Not Interchangeable"],"verification_warning":"This is a candidate exercise. Mechanical recomputation checks only the stated conditions and this instance; it is neither a formal proof nor human review."}}
{"schema_version":"ocme-question-localization-v0.1","question_id":"q-20261015-advance-20261118-r06-regular-expression-0092","batch_id":"batch-20261015-advance-20261118-r06-regular-expression-foundations","locale":"en","translation_state":"ai_candidate","source":{"question_sha256":"93e7b169e3e202f5d39dc17727d38243d794f408283bb6dbdd40ed9c105e4500","family_id":"qf-mod49-regex-boundary","seed":202611186092,"semantic_template":"regex-boundary|{mode:\"concat_order\",model:{alphabet:[\"a\",\"b\",\"c\"],left:{children:[{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"}],type:\"concat\"},max_length:4,right:{children:[{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"a\"}],type:\"concat\"}}}"},"fields":{"title":"Empty Language, Epsilon, Wildcards and Bounded Equality Are Not Interchangeable","stem":"Use mode=concat_order, complete model={\"alphabet\":[\"a\",\"b\",\"c\"],\"left\":{\"type\":\"concat\",\"children\":[{\"type\":\"symbol\",\"value\":\"a\"},{\"type\":\"symbol\",\"value\":\"a\"},{\"type\":\"symbol\",\"value\":\"a\"},{\"type\":\"symbol\",\"value\":\"b\"}]},\"right\":{\"type\":\"concat\",\"children\":[{\"type\":\"symbol\",\"value\":\"b\"},{\"type\":\"symbol\",\"value\":\"a\"},{\"type\":\"symbol\",\"value\":\"a\"},{\"type\":\"symbol\",\"value\":\"a\"}]},\"max_length\":4}. Give (mode, left_AST, right_AST, left_bounded_language, right_bounded_language, bounded_languages_equal, order_irrelevance_claim, boundary).","answer":{"kind":"expression","value":"(concat_order, {children:[{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"}],type:\"concat\"}, {children:[{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"a\"}],type:\"concat\"}, [[a, a, a, b]], [[b, a, a, a]], No, No, concatenation_order_is_semantic)","explanation":"empty_vs_epsilon separates [] from[[]]. A wildcard token is not a core typed AST node. bounded_equality retains equality through the bound and a genuine distinguishing next-length slice, so unbounded equivalence is No. concat_order retains the ordered ASTs and their genuinely different bounded languages. The exact result, retaining the requested order, is (concat_order, {children:[{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"}],type:\"concat\"}, {children:[{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"a\"}],type:\"concat\"}, [[a, a, a, b]], [[b, a, a, a]], No, No, concatenation_order_is_semantic)."},"skills":["Empty Language, Epsilon, Wildcards and Bounded Equality Are Not Interchangeable"],"verification_warning":"This is a candidate exercise. Mechanical recomputation checks only the stated conditions and this instance; it is neither a formal proof nor human review."}}
{"schema_version":"ocme-question-localization-v0.1","question_id":"q-20261015-advance-20261118-r06-regular-expression-0093","batch_id":"batch-20261015-advance-20261118-r06-regular-expression-foundations","locale":"en","translation_state":"ai_candidate","source":{"question_sha256":"f2422919963120d0c4a44c7e873278ebc41307feb5d715cad8077aeb11e9cfc8","family_id":"qf-mod49-regex-boundary","seed":202611186093,"semantic_template":"regex-boundary|{mode:\"bounded_equality\",model:{alphabet:[\"b\"],left:{type:\"epsilon\"},max_length:1,right:{children:[{children:[{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"b\"}],type:\"concat\"},{type:\"epsilon\"}],type:\"union\"}}}"},"fields":{"title":"Empty Language, Epsilon, Wildcards and Bounded Equality Are Not Interchangeable","stem":"Use mode=bounded_equality, complete model={\"alphabet\":[\"b\"],\"left\":{\"type\":\"epsilon\"},\"right\":{\"type\":\"union\",\"children\":[{\"type\":\"epsilon\"},{\"type\":\"concat\",\"children\":[{\"type\":\"symbol\",\"value\":\"b\"},{\"type\":\"symbol\",\"value\":\"b\"}]}]},\"max_length\":1}. Give (mode, bound, left_bounded_language, right_bounded_language, equal_through_bound, next_bound, left_next_language, right_next_language, differs_at_next_bound, unbounded_equivalence_claim, boundary).","answer":{"kind":"expression","value":"(bounded_equality, 1, [[]], [[]], Yes, 2, [[]], [[], [b, b]], Yes, No, bounded_language_equality_does_not_prove_regex_equivalence)","explanation":"empty_vs_epsilon separates [] from[[]]. A wildcard token is not a core typed AST node. bounded_equality retains equality through the bound and a genuine distinguishing next-length slice, so unbounded equivalence is No. concat_order retains the ordered ASTs and their genuinely different bounded languages. The exact result, retaining the requested order, is (bounded_equality, 1, [[]], [[]], Yes, 2, [[]], [[], [b, b]], Yes, No, bounded_language_equality_does_not_prove_regex_equivalence)."},"skills":["Empty Language, Epsilon, Wildcards and Bounded Equality Are Not Interchangeable"],"verification_warning":"This is a candidate exercise. Mechanical recomputation checks only the stated conditions and this instance; it is neither a formal proof nor human review."}}
{"schema_version":"ocme-question-localization-v0.1","question_id":"q-20261015-advance-20261118-r06-regular-expression-0094","batch_id":"batch-20261015-advance-20261118-r06-regular-expression-foundations","locale":"en","translation_state":"ai_candidate","source":{"question_sha256":"744343bd582894f55b07a7ede1eddbe32c946c9e9d3898cd502e8f2560764bf0","family_id":"qf-mod49-regex-boundary","seed":202611186094,"semantic_template":"regex-boundary|{mode:\"concat_order\",model:{alphabet:[\"a\",\"b\",\"c\"],left:{children:[{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"}],type:\"concat\"},max_length:5,right:{children:[{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"b\"}],type:\"concat\"}}}"},"fields":{"title":"Empty Language, Epsilon, Wildcards and Bounded Equality Are Not Interchangeable","stem":"Use mode=concat_order, complete model={\"alphabet\":[\"a\",\"b\",\"c\"],\"left\":{\"type\":\"concat\",\"children\":[{\"type\":\"symbol\",\"value\":\"b\"},{\"type\":\"symbol\",\"value\":\"b\"},{\"type\":\"symbol\",\"value\":\"b\"},{\"type\":\"symbol\",\"value\":\"b\"},{\"type\":\"symbol\",\"value\":\"c\"}]},\"right\":{\"type\":\"concat\",\"children\":[{\"type\":\"symbol\",\"value\":\"c\"},{\"type\":\"symbol\",\"value\":\"b\"},{\"type\":\"symbol\",\"value\":\"b\"},{\"type\":\"symbol\",\"value\":\"b\"},{\"type\":\"symbol\",\"value\":\"b\"}]},\"max_length\":5}. Give (mode, left_AST, right_AST, left_bounded_language, right_bounded_language, bounded_languages_equal, order_irrelevance_claim, boundary).","answer":{"kind":"expression","value":"(concat_order, {children:[{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"}],type:\"concat\"}, {children:[{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"b\"}],type:\"concat\"}, [[b, b, b, b, c]], [[c, b, b, b, b]], No, No, concatenation_order_is_semantic)","explanation":"empty_vs_epsilon separates [] from[[]]. A wildcard token is not a core typed AST node. bounded_equality retains equality through the bound and a genuine distinguishing next-length slice, so unbounded equivalence is No. concat_order retains the ordered ASTs and their genuinely different bounded languages. The exact result, retaining the requested order, is (concat_order, {children:[{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"}],type:\"concat\"}, {children:[{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"b\"}],type:\"concat\"}, [[b, b, b, b, c]], [[c, b, b, b, b]], No, No, concatenation_order_is_semantic)."},"skills":["Empty Language, Epsilon, Wildcards and Bounded Equality Are Not Interchangeable"],"verification_warning":"This is a candidate exercise. Mechanical recomputation checks only the stated conditions and this instance; it is neither a formal proof nor human review."}}
{"schema_version":"ocme-question-localization-v0.1","question_id":"q-20261015-advance-20261118-r06-regular-expression-0095","batch_id":"batch-20261015-advance-20261118-r06-regular-expression-foundations","locale":"en","translation_state":"ai_candidate","source":{"question_sha256":"b8351749fa7cab36916a27390fc03e251aba47f58006c49dfbe83af6e962fea4","family_id":"qf-mod49-regex-boundary","seed":202611186095,"semantic_template":"regex-boundary|{mode:\"bounded_equality\",model:{alphabet:[\"c\"],left:{type:\"epsilon\"},max_length:2,right:{children:[{children:[{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"c\"}],type:\"concat\"},{type:\"epsilon\"}],type:\"union\"}}}"},"fields":{"title":"Empty Language, Epsilon, Wildcards and Bounded Equality Are Not Interchangeable","stem":"Use mode=bounded_equality, complete model={\"alphabet\":[\"c\"],\"left\":{\"type\":\"epsilon\"},\"right\":{\"type\":\"union\",\"children\":[{\"type\":\"epsilon\"},{\"type\":\"concat\",\"children\":[{\"type\":\"symbol\",\"value\":\"c\"},{\"type\":\"symbol\",\"value\":\"c\"},{\"type\":\"symbol\",\"value\":\"c\"}]}]},\"max_length\":2}. Give (mode, bound, left_bounded_language, right_bounded_language, equal_through_bound, next_bound, left_next_language, right_next_language, differs_at_next_bound, unbounded_equivalence_claim, boundary).","answer":{"kind":"expression","value":"(bounded_equality, 2, [[]], [[]], Yes, 3, [[]], [[], [c, c, c]], Yes, No, bounded_language_equality_does_not_prove_regex_equivalence)","explanation":"empty_vs_epsilon separates [] from[[]]. A wildcard token is not a core typed AST node. bounded_equality retains equality through the bound and a genuine distinguishing next-length slice, so unbounded equivalence is No. concat_order retains the ordered ASTs and their genuinely different bounded languages. The exact result, retaining the requested order, is (bounded_equality, 2, [[]], [[]], Yes, 3, [[]], [[], [c, c, c]], Yes, No, bounded_language_equality_does_not_prove_regex_equivalence)."},"skills":["Empty Language, Epsilon, Wildcards and Bounded Equality Are Not Interchangeable"],"verification_warning":"This is a candidate exercise. Mechanical recomputation checks only the stated conditions and this instance; it is neither a formal proof nor human review."}}
{"schema_version":"ocme-question-localization-v0.1","question_id":"q-20261015-advance-20261118-r06-regular-expression-0096","batch_id":"batch-20261015-advance-20261118-r06-regular-expression-foundations","locale":"en","translation_state":"ai_candidate","source":{"question_sha256":"f9b3978ad5a60b180fb2808f75e43fca565bab8292ae86c9b7ebb78502f750e8","family_id":"qf-mod49-regex-boundary","seed":202611186096,"semantic_template":"regex-boundary|{mode:\"concat_order\",model:{alphabet:[\"a\",\"b\",\"c\"],left:{children:[{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"}],type:\"concat\"},max_length:2,right:{children:[{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"c\"}],type:\"concat\"}}}"},"fields":{"title":"Empty Language, Epsilon, Wildcards and Bounded Equality Are Not Interchangeable","stem":"Use mode=concat_order, complete model={\"alphabet\":[\"a\",\"b\",\"c\"],\"left\":{\"type\":\"concat\",\"children\":[{\"type\":\"symbol\",\"value\":\"c\"},{\"type\":\"symbol\",\"value\":\"a\"}]},\"right\":{\"type\":\"concat\",\"children\":[{\"type\":\"symbol\",\"value\":\"a\"},{\"type\":\"symbol\",\"value\":\"c\"}]},\"max_length\":2}. Give (mode, left_AST, right_AST, left_bounded_language, right_bounded_language, bounded_languages_equal, order_irrelevance_claim, boundary).","answer":{"kind":"expression","value":"(concat_order, {children:[{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"}],type:\"concat\"}, {children:[{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"c\"}],type:\"concat\"}, [[c, a]], [[a, c]], No, No, concatenation_order_is_semantic)","explanation":"empty_vs_epsilon separates [] from[[]]. A wildcard token is not a core typed AST node. bounded_equality retains equality through the bound and a genuine distinguishing next-length slice, so unbounded equivalence is No. concat_order retains the ordered ASTs and their genuinely different bounded languages. The exact result, retaining the requested order, is (concat_order, {children:[{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"a\"}],type:\"concat\"}, {children:[{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"c\"}],type:\"concat\"}, [[c, a]], [[a, c]], No, No, concatenation_order_is_semantic)."},"skills":["Empty Language, Epsilon, Wildcards and Bounded Equality Are Not Interchangeable"],"verification_warning":"This is a candidate exercise. Mechanical recomputation checks only the stated conditions and this instance; it is neither a formal proof nor human review."}}
{"schema_version":"ocme-question-localization-v0.1","question_id":"q-20261015-advance-20261118-r06-regular-expression-0097","batch_id":"batch-20261015-advance-20261118-r06-regular-expression-foundations","locale":"en","translation_state":"ai_candidate","source":{"question_sha256":"f991a41af748e1c7795f9ac22372c963d25fd81f377eaef541cf1d709e9246bb","family_id":"qf-mod49-regex-boundary","seed":202611186097,"semantic_template":"regex-boundary|{mode:\"bounded_equality\",model:{alphabet:[\"a\"],left:{type:\"epsilon\"},max_length:3,right:{children:[{children:[{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"a\"}],type:\"concat\"},{type:\"epsilon\"}],type:\"union\"}}}"},"fields":{"title":"Empty Language, Epsilon, Wildcards and Bounded Equality Are Not Interchangeable","stem":"Use mode=bounded_equality, complete model={\"alphabet\":[\"a\"],\"left\":{\"type\":\"epsilon\"},\"right\":{\"type\":\"union\",\"children\":[{\"type\":\"epsilon\"},{\"type\":\"concat\",\"children\":[{\"type\":\"symbol\",\"value\":\"a\"},{\"type\":\"symbol\",\"value\":\"a\"},{\"type\":\"symbol\",\"value\":\"a\"},{\"type\":\"symbol\",\"value\":\"a\"}]}]},\"max_length\":3}. Give (mode, bound, left_bounded_language, right_bounded_language, equal_through_bound, next_bound, left_next_language, right_next_language, differs_at_next_bound, unbounded_equivalence_claim, boundary).","answer":{"kind":"expression","value":"(bounded_equality, 3, [[]], [[]], Yes, 4, [[]], [[], [a, a, a, a]], Yes, No, bounded_language_equality_does_not_prove_regex_equivalence)","explanation":"empty_vs_epsilon separates [] from[[]]. A wildcard token is not a core typed AST node. bounded_equality retains equality through the bound and a genuine distinguishing next-length slice, so unbounded equivalence is No. concat_order retains the ordered ASTs and their genuinely different bounded languages. The exact result, retaining the requested order, is (bounded_equality, 3, [[]], [[]], Yes, 4, [[]], [[], [a, a, a, a]], Yes, No, bounded_language_equality_does_not_prove_regex_equivalence)."},"skills":["Empty Language, Epsilon, Wildcards and Bounded Equality Are Not Interchangeable"],"verification_warning":"This is a candidate exercise. Mechanical recomputation checks only the stated conditions and this instance; it is neither a formal proof nor human review."}}
{"schema_version":"ocme-question-localization-v0.1","question_id":"q-20261015-advance-20261118-r06-regular-expression-0098","batch_id":"batch-20261015-advance-20261118-r06-regular-expression-foundations","locale":"en","translation_state":"ai_candidate","source":{"question_sha256":"772dfb84907c2767d4b35424c972953e2e4e6d444f605dfecd4298f340f64fdf","family_id":"qf-mod49-regex-boundary","seed":202611186098,"semantic_template":"regex-boundary|{mode:\"concat_order\",model:{alphabet:[\"a\",\"b\",\"c\"],left:{children:[{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"}],type:\"concat\"},max_length:3,right:{children:[{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"a\"}],type:\"concat\"}}}"},"fields":{"title":"Empty Language, Epsilon, Wildcards and Bounded Equality Are Not Interchangeable","stem":"Use mode=concat_order, complete model={\"alphabet\":[\"a\",\"b\",\"c\"],\"left\":{\"type\":\"concat\",\"children\":[{\"type\":\"symbol\",\"value\":\"a\"},{\"type\":\"symbol\",\"value\":\"a\"},{\"type\":\"symbol\",\"value\":\"b\"}]},\"right\":{\"type\":\"concat\",\"children\":[{\"type\":\"symbol\",\"value\":\"b\"},{\"type\":\"symbol\",\"value\":\"a\"},{\"type\":\"symbol\",\"value\":\"a\"}]},\"max_length\":3}. Give (mode, left_AST, right_AST, left_bounded_language, right_bounded_language, bounded_languages_equal, order_irrelevance_claim, boundary).","answer":{"kind":"expression","value":"(concat_order, {children:[{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"}],type:\"concat\"}, {children:[{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"a\"}],type:\"concat\"}, [[a, a, b]], [[b, a, a]], No, No, concatenation_order_is_semantic)","explanation":"empty_vs_epsilon separates [] from[[]]. A wildcard token is not a core typed AST node. bounded_equality retains equality through the bound and a genuine distinguishing next-length slice, so unbounded equivalence is No. concat_order retains the ordered ASTs and their genuinely different bounded languages. The exact result, retaining the requested order, is (concat_order, {children:[{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"b\"}],type:\"concat\"}, {children:[{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"a\"},{type:\"symbol\",value:\"a\"}],type:\"concat\"}, [[a, a, b]], [[b, a, a]], No, No, concatenation_order_is_semantic)."},"skills":["Empty Language, Epsilon, Wildcards and Bounded Equality Are Not Interchangeable"],"verification_warning":"This is a candidate exercise. Mechanical recomputation checks only the stated conditions and this instance; it is neither a formal proof nor human review."}}
{"schema_version":"ocme-question-localization-v0.1","question_id":"q-20261015-advance-20261118-r06-regular-expression-0099","batch_id":"batch-20261015-advance-20261118-r06-regular-expression-foundations","locale":"en","translation_state":"ai_candidate","source":{"question_sha256":"19d4f76155ef9762078decaf0ad38352c030144153c4ab4eb41b93ebe8d1b687","family_id":"qf-mod49-regex-boundary","seed":202611186099,"semantic_template":"regex-boundary|{mode:\"bounded_equality\",model:{alphabet:[\"b\"],left:{type:\"epsilon\"},max_length:4,right:{children:[{children:[{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"b\"}],type:\"concat\"},{type:\"epsilon\"}],type:\"union\"}}}"},"fields":{"title":"Empty Language, Epsilon, Wildcards and Bounded Equality Are Not Interchangeable","stem":"Use mode=bounded_equality, complete model={\"alphabet\":[\"b\"],\"left\":{\"type\":\"epsilon\"},\"right\":{\"type\":\"union\",\"children\":[{\"type\":\"epsilon\"},{\"type\":\"concat\",\"children\":[{\"type\":\"symbol\",\"value\":\"b\"},{\"type\":\"symbol\",\"value\":\"b\"},{\"type\":\"symbol\",\"value\":\"b\"},{\"type\":\"symbol\",\"value\":\"b\"},{\"type\":\"symbol\",\"value\":\"b\"}]}]},\"max_length\":4}. Give (mode, bound, left_bounded_language, right_bounded_language, equal_through_bound, next_bound, left_next_language, right_next_language, differs_at_next_bound, unbounded_equivalence_claim, boundary).","answer":{"kind":"expression","value":"(bounded_equality, 4, [[]], [[]], Yes, 5, [[]], [[], [b, b, b, b, b]], Yes, No, bounded_language_equality_does_not_prove_regex_equivalence)","explanation":"empty_vs_epsilon separates [] from[[]]. A wildcard token is not a core typed AST node. bounded_equality retains equality through the bound and a genuine distinguishing next-length slice, so unbounded equivalence is No. concat_order retains the ordered ASTs and their genuinely different bounded languages. The exact result, retaining the requested order, is (bounded_equality, 4, [[]], [[]], Yes, 5, [[]], [[], [b, b, b, b, b]], Yes, No, bounded_language_equality_does_not_prove_regex_equivalence)."},"skills":["Empty Language, Epsilon, Wildcards and Bounded Equality Are Not Interchangeable"],"verification_warning":"This is a candidate exercise. Mechanical recomputation checks only the stated conditions and this instance; it is neither a formal proof nor human review."}}
{"schema_version":"ocme-question-localization-v0.1","question_id":"q-20261015-advance-20261118-r06-regular-expression-0100","batch_id":"batch-20261015-advance-20261118-r06-regular-expression-foundations","locale":"en","translation_state":"ai_candidate","source":{"question_sha256":"8e382761a2a57f1742476a3bdc446e36781ce8c62ea9c22d81dfac32019f6a95","family_id":"qf-mod49-regex-boundary","seed":202611186100,"semantic_template":"regex-boundary|{mode:\"concat_order\",model:{alphabet:[\"a\",\"b\",\"c\"],left:{children:[{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"}],type:\"concat\"},max_length:4,right:{children:[{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"b\"}],type:\"concat\"}}}"},"fields":{"title":"Empty Language, Epsilon, Wildcards and Bounded Equality Are Not Interchangeable","stem":"Use mode=concat_order, complete model={\"alphabet\":[\"a\",\"b\",\"c\"],\"left\":{\"type\":\"concat\",\"children\":[{\"type\":\"symbol\",\"value\":\"b\"},{\"type\":\"symbol\",\"value\":\"b\"},{\"type\":\"symbol\",\"value\":\"b\"},{\"type\":\"symbol\",\"value\":\"c\"}]},\"right\":{\"type\":\"concat\",\"children\":[{\"type\":\"symbol\",\"value\":\"c\"},{\"type\":\"symbol\",\"value\":\"b\"},{\"type\":\"symbol\",\"value\":\"b\"},{\"type\":\"symbol\",\"value\":\"b\"}]},\"max_length\":4}. Give (mode, left_AST, right_AST, left_bounded_language, right_bounded_language, bounded_languages_equal, order_irrelevance_claim, boundary).","answer":{"kind":"expression","value":"(concat_order, {children:[{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"}],type:\"concat\"}, {children:[{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"b\"}],type:\"concat\"}, [[b, b, b, c]], [[c, b, b, b]], No, No, concatenation_order_is_semantic)","explanation":"empty_vs_epsilon separates [] from[[]]. A wildcard token is not a core typed AST node. bounded_equality retains equality through the bound and a genuine distinguishing next-length slice, so unbounded equivalence is No. concat_order retains the ordered ASTs and their genuinely different bounded languages. The exact result, retaining the requested order, is (concat_order, {children:[{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"c\"}],type:\"concat\"}, {children:[{type:\"symbol\",value:\"c\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"b\"},{type:\"symbol\",value:\"b\"}],type:\"concat\"}, [[b, b, b, c]], [[c, b, b, b]], No, No, concatenation_order_is_semantic)."},"skills":["Empty Language, Epsilon, Wildcards and Bounded Equality Are Not Interchangeable"],"verification_warning":"This is a candidate exercise. Mechanical recomputation checks only the stated conditions and this instance; it is neither a formal proof nor human review."}}