{"schema_version":"ocme-public-explorer-results-v1","locale":"zh-Hant","filters":{"q":"q-20261014-advance-20261101-r07-finite-automaton-0013"},"total":1,"page":1,"page_count":1,"question_state":"candidate","english_state":"ai_candidate","canonical_truth_promotion":false,"entries":[{"question_id":"q-20261014-advance-20261101-r07-finite-automaton-0013","number":16238,"title":{"zh-Hant":"第 16238 題：確定有限自動機","en":"Question 16238: A DFA Needs a Complete Total Deterministic Transition Table"},"family_id":"qf-mod32-dfa-qualification","batch_id":"batch-20261014-advance-20261101-r07-finite-automaton-foundations","mko_ids":["mko-finite-automaton"],"question_state":"candidate","english_state":"ai_candidate","processing_state":"second_context_reviewed","source_question_sha256":"598cc6d456d20e0b888a1936b26dcd8c5b818814ddbf01d0ded2e7c838ff0e6c","derivation_sha256":"3f6f788f7fce498b8ecad4201efa5445e1982051277b7cc9804f8b42da623bd7"}]}