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