{"id":"W6940031851","doi":"10.7282/t3g73htz","title":"Better Complexity Bounds for Cost Register Automata","year":2017,"lang":"en","type":"preprint","venue":"Rutgers University Community Repository (Rutgers University)","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Montréal","funders":"","keywords":"Semiring; Automaton; Class (philosophy); Set (abstract data type); Polynomial; State (computer science); Time complexity; Finite-state machine","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.00401477,0.001148668,0.001475105,0.002086975,0.001519723,0.007060629,0.002973927,0.002020648,0.01727425],"category_scores_gemma":[0.02954333,0.0007470648,0.003213269,0.002085729,0.004039414,0.02025267,0.004797809,0.008665694,0.00199811],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005895628,"about_ca_system_score_gemma":0.002471305,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002715888,"about_ca_topic_score_gemma":0.002955569,"domain_scores_codex":[0.9931061,0.00139602,0.000401615,0.001852021,0.002252794,0.0009915732],"domain_scores_gemma":[0.9553298,0.03300066,0.001527281,0.00714048,0.001893017,0.001108702],"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.0002869784,0.0001211623,0.001640894,0.0003048926,0.00005140992,0.0001036528,0.0003999467,0.02901628,0.003168358,0.9385191,0.005755451,0.02063197],"study_design_scores_gemma":[0.00003304281,0.00004817784,0.000402079,0.00004467124,0.00004294255,0.00006951848,0.00008908907,0.09640503,0.002198096,0.8951508,0.005485181,0.00003140863],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2422005,0.004581788,0.6242506,0.01964306,0.0007016471,0.0002735099,0.002476479,0.002788734,0.1030836],"genre_scores_gemma":[0.887867,0.001614103,0.09019986,0.001660493,0.0008622222,0.0003344673,0.001643448,0.0009404831,0.01487799],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01727425,"threshold_uncertainty_score":0.05778813,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1161415204384949,"score_gpt":0.2931913132008235,"score_spread":0.1770497927623286,"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."}}