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