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