{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004452764,0.0001107817,0.0001597023,0.00004343432,0.0001433598,0.00008863881,0.0005764863,0.00003766392,0.0003554703],"category_scores_gemma":[0.00007433326,0.0000770437,0.00004547385,0.0001327844,0.000359201,0.0002434364,0.0001862824,0.00007441983,0.00002455517],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001365553,"about_ca_system_score_gemma":0.00002774502,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004988711,"about_ca_topic_score_gemma":0.000006207532,"domain_scores_codex":[0.9986691,0.00009218074,0.0005502794,0.0002196425,0.0003649281,0.0001038544],"domain_scores_gemma":[0.9980217,0.0008060143,0.0005359912,0.0003895332,0.0002124944,0.0000342436],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002835825,0.00006304561,0.002943187,0.00001311716,0.00003741211,1.577561e-7,0.0005438179,0.00000825184,0.0002648821,0.9421147,0.0005357452,0.0534474],"study_design_scores_gemma":[0.002564787,0.00005411009,0.03875389,0.00004426944,0.00003222392,0.00002439555,0.0006017441,0.8826917,0.001686211,0.07001762,0.003367015,0.0001619939],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5929477,0.0001090574,0.3033932,0.03024009,0.0004478504,0.001915284,0.0007322454,0.0002481361,0.0699664],"genre_scores_gemma":[0.9970022,0.0001586231,0.002383149,0.0001595276,0.00001414625,0.00005501176,0.00002688616,0.000005268923,0.0001951678],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8826835,"threshold_uncertainty_score":0.389215,"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."}}