{"id":"W2099395836","doi":"10.1109/tai.1991.167123","title":"Searching for a minimal finite state automaton (FSA)","year":2002,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Calgary","funders":"","keywords":"Heuristics; Pruning; Automaton; Computer science; Finite-state machine; Tree (set theory); Search algorithm; Theoretical computer science; State (computer science); Algorithm; Process (computing); Mathematics; Combinatorics; Programming language","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005743554,0.0005482002,0.0007372044,0.0009710186,0.00113654,0.001153761,0.00105573,0.0008798799,0.006557791],"category_scores_gemma":[0.002788633,0.000511536,0.001202254,0.0007296274,0.0009339556,0.001186365,0.0009207347,0.0007617925,0.001265656],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007386355,"about_ca_system_score_gemma":0.002440044,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004122322,"about_ca_topic_score_gemma":0.006206763,"domain_scores_codex":[0.9994255,0.0001153444,0.00004180305,0.0001679685,0.0001686573,0.00008061762],"domain_scores_gemma":[0.9990491,0.0005639862,0.00007019287,0.00009168697,0.0001915305,0.00003359255],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003832353,0.0002784735,0.005214437,0.001166644,0.000199485,0.0008537524,0.0006467976,0.3544243,0.05257171,0.1646365,0.01063507,0.4089895],"study_design_scores_gemma":[0.00006002704,0.0001663713,0.0005091565,0.0001237714,0.0001084605,0.0002874313,0.0002520147,0.867253,0.01793011,0.09924887,0.01401968,0.00004116507],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02952385,0.0002073027,0.9618809,0.0003022222,0.00003327285,0.000136347,0.0003478411,0.002245941,0.005322324],"genre_scores_gemma":[0.2175,0.0001687808,0.7783009,0.00009577427,0.000009674048,0.0002581702,0.0008420427,0.0001796465,0.002644991],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006557791,"threshold_uncertainty_score":0.02193803,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03038841623358071,"score_gpt":0.2498491361406745,"score_spread":0.2194607199070938,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}