{"id":"W1971074104","doi":"10.5555/1756384.1756392","title":"The number of similarity relations and the number of minimal deterministic finite cover automata","year":2002,"lang":"en","type":"article","venue":"International Conference on Implementation and application of automata","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"Western University; University of Prince Edward Island","funders":"","keywords":"Deterministic finite automaton; Mathematics; Combinatorics; Unary operation; Quantum finite automata; Nondeterministic finite automaton; Upper and lower bounds; Discrete mathematics; Cover (algebra); Equivalence relation; Finite-state machine; DFA minimization; Integer (computer science); Automaton; Automata theory; Algorithm; Computer science; Theoretical computer science","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.002971123,0.0005318401,0.001913223,0.00209132,0.003241523,0.005183983,0.002746458,0.003118862,0.008704486],"category_scores_gemma":[0.0257877,0.00128418,0.001907796,0.001841109,0.004099976,0.009909397,0.002762275,0.002103728,0.0006900504],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002317164,"about_ca_system_score_gemma":0.001629103,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005910297,"about_ca_topic_score_gemma":0.000984838,"domain_scores_codex":[0.994231,0.001444144,0.0006658931,0.001395253,0.001536831,0.0007269631],"domain_scores_gemma":[0.9373088,0.04823504,0.004241183,0.004553207,0.002293139,0.003368627],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002359893,0.0005495669,0.02333328,0.0008193445,0.0003839053,0.000566221,0.001682702,0.04509922,0.02621559,0.8347661,0.00524426,0.05897987],"study_design_scores_gemma":[0.000170924,0.0002093432,0.004524024,0.00006009745,0.000228858,0.000969256,0.0003849594,0.1039731,0.01366376,0.8721825,0.003553648,0.00007952012],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8984618,0.0006063726,0.08177908,0.002179586,0.00008422713,0.0001311098,0.001094187,0.0004514742,0.01521224],"genre_scores_gemma":[0.9709024,0.0002156121,0.02447248,0.0001780603,0.0001121389,0.0001785531,0.0007480906,0.00009929336,0.003093242],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008704486,"threshold_uncertainty_score":0.02911937,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03105199893235442,"score_gpt":0.3442500903936715,"score_spread":0.3131980914613171,"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."}}