{"schema_version":"ocme-public-explorer-results-v1","locale":"en","filters":{"q":"q-20261014-advance-20261101-r07-finite-automaton-0014"},"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-0014","number":16239,"title":{"zh-Hant":"第 16239 題：確定有限自動機","en":"Question 16239: 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":"363d4ef13b808a6a106d07dbe780da9415e512a2c297c918fbf32b1041a8c6b2","derivation_sha256":"4d36afcc5f950da4773c543b5f3f22656e8bf8bfdf3ed2e1eec988fab515ca1b"}]}