{"id":"W1994122595","doi":"10.1142/s0129054103002138","title":"COUNTING THE NUMBER OF MINIMAL DFCA OBTAINED BY MERGING STATES","year":2003,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"Western University; University of Prince Edward Island","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Unary operation; Mathematics; Combinatorics; Deterministic finite automaton; Upper and lower bounds; Alphabet; Discrete mathematics; Integer (computer science); Nondeterministic finite automaton; Quantum finite automata; Regular language; Automaton; Finite-state machine; Algorithm; Automata theory; Computer science; Theoretical computer science","routes":{"ca_aff":true,"ca_fund":true,"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.001852242,0.0005531352,0.0009718668,0.001591727,0.00161308,0.001396129,0.001882597,0.001252464,0.003856922],"category_scores_gemma":[0.01648417,0.000526063,0.00126444,0.001546828,0.001176433,0.003848088,0.001625939,0.0006976521,0.0005452465],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001182979,"about_ca_system_score_gemma":0.001258404,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008024979,"about_ca_topic_score_gemma":0.001614015,"domain_scores_codex":[0.9968132,0.000681677,0.0004129032,0.000577409,0.001090287,0.0004244483],"domain_scores_gemma":[0.9836263,0.01139897,0.001172873,0.00178014,0.001471908,0.0005497927],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00271243,0.000688405,0.06066976,0.002312606,0.0005114721,0.001574093,0.001452933,0.2193218,0.1395146,0.1437556,0.006098439,0.4213879],"study_design_scores_gemma":[0.0001204548,0.0006287336,0.01081535,0.0001861922,0.0005764631,0.002694991,0.000514516,0.5923606,0.178522,0.1976231,0.01579787,0.0001597063],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7096469,0.0006917669,0.2780497,0.0004798714,0.00006223583,0.0002540286,0.0008341997,0.00119164,0.008789618],"genre_scores_gemma":[0.7345933,0.0002909573,0.2591752,0.0001046833,0.00004692518,0.0004977795,0.001705102,0.0002542377,0.003331771],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003856922,"threshold_uncertainty_score":0.01290268,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009420720844945022,"score_gpt":0.2876393450828633,"score_spread":0.2782186242379183,"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."}}