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