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