{"id":"W2128534664","doi":"10.4230/lipics.mfcs.2017.24","title":"Better Complexity Bounds for Cost Register Automata","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Deutsche Forschungsgemeinschaft; Natural Sciences and Engineering Research Council of Canada; McGill University; National Science Foundation","keywords":"Nondeterministic algorithm; Parameterized complexity; Computer science; Finite-state machine; Automaton; Theory of computation; Theoretical computer science; Nondeterministic finite automaton; Automata theory; Mathematics; Algorithm","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004400451,0.0004198154,0.0004721448,0.0002202339,0.0002605784,0.0002711171,0.003505434,0.0003487937,0.00007408459],"category_scores_gemma":[0.00002542388,0.0004622632,0.0003772257,0.0002754971,0.000310902,0.0005188477,0.003069695,0.0004515464,0.0001505315],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001836461,"about_ca_system_score_gemma":0.0001506568,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001594468,"about_ca_topic_score_gemma":0.00004514678,"domain_scores_codex":[0.9975334,0.000129042,0.0002668598,0.001421739,0.00009791004,0.0005509949],"domain_scores_gemma":[0.9966043,0.0001456803,0.0003485975,0.002545884,0.0001548741,0.0002007188],"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.00005369719,0.0001633628,0.0005892634,0.0001671953,0.0001348875,0.0001422503,0.000328238,0.0005777563,0.00002307538,0.984782,0.01010098,0.002937285],"study_design_scores_gemma":[0.0008569349,0.00006995483,0.001666594,0.0001139556,0.00007783691,0.00001115188,0.00002639311,0.3503836,0.0001756314,0.6299792,0.01589976,0.0007389376],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0589055,0.0000406584,0.929044,0.0003505792,0.001249731,0.0007397679,0.0000990869,0.0007537765,0.008816892],"genre_scores_gemma":[0.9806739,0.00003221581,0.01462042,0.0009670536,0.0001742218,0.000007716998,0.00007924107,0.00003825917,0.00340695],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9217684,"threshold_uncertainty_score":0.9997829,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1970483097902736,"score_gpt":0.2135294783847136,"score_spread":0.01648116859443999,"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."}}