{"id":"W4237199268","doi":"10.1007/3-540-44977-9_6","title":"The Number of Similarity Relations and the Number of Minimal Deterministic Finite Cover Automata","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Western University; University of Prince Edward Island","funders":"","keywords":"Deterministic finite automaton; Unary operation; Combinatorics; Equivalence relation; Nondeterministic finite automaton; Upper and lower bounds; Cover (algebra); Mathematics; Quantum finite automata; Discrete mathematics; Finite-state machine; Alphabet; DFA minimization; Similarity (geometry); Automaton; Algorithm; Automata theory; 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.002381784,0.0005269412,0.00190689,0.002020863,0.002852674,0.005123566,0.002695128,0.002758537,0.008243915],"category_scores_gemma":[0.01803741,0.001215467,0.001645832,0.002173784,0.004295783,0.01031285,0.002288439,0.002204576,0.0007146714],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002224287,"about_ca_system_score_gemma":0.001156456,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004646154,"about_ca_topic_score_gemma":0.000704255,"domain_scores_codex":[0.996066,0.0009249124,0.0003875294,0.001024378,0.001130335,0.000466871],"domain_scores_gemma":[0.9628255,0.02861897,0.002481579,0.002787113,0.001256719,0.002030019],"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.001040258,0.0002208826,0.009014898,0.0005250882,0.0001864339,0.0002688222,0.0009404074,0.02087549,0.01217731,0.908823,0.004114137,0.0418133],"study_design_scores_gemma":[0.00007282907,0.0000905975,0.002056532,0.00003734332,0.0001030453,0.0005564576,0.0001655223,0.03943572,0.005409924,0.9491152,0.002915659,0.00004124362],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8568709,0.00117376,0.1038425,0.002486664,0.0001219312,0.0001291244,0.001238317,0.0004740986,0.03366261],"genre_scores_gemma":[0.9661613,0.0004062687,0.02640031,0.0001730305,0.0001900055,0.000178196,0.0007738401,0.0001033992,0.005613626],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008243915,"threshold_uncertainty_score":0.02757865,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01169531033648017,"score_gpt":0.2502640338655513,"score_spread":0.2385687235290711,"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."}}