{"id":"W6959215644","doi":"10.7282/t38k7dgb","title":"Better Complexity Bounds for Cost Register Automata","year":2018,"lang":"en","type":"article","venue":"View","topic":"semigroups and automata theory","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.004276405,0.001105649,0.001539945,0.002093135,0.001661957,0.006659285,0.002946684,0.002162333,0.01668262],"category_scores_gemma":[0.02783722,0.0006937376,0.002773995,0.001942354,0.004240596,0.02222984,0.00484866,0.009460826,0.002000267],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005915386,"about_ca_system_score_gemma":0.002077903,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002361636,"about_ca_topic_score_gemma":0.00231972,"domain_scores_codex":[0.9939573,0.001177052,0.000320893,0.001664537,0.002002367,0.0008778491],"domain_scores_gemma":[0.9539487,0.0348532,0.001410211,0.006549618,0.002007413,0.001230889],"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.0002047969,0.0001048051,0.001077136,0.00024287,0.00003435008,0.00008707215,0.0003791238,0.0167976,0.002431813,0.9578716,0.005916639,0.01485213],"study_design_scores_gemma":[0.00002579919,0.00004725106,0.0004115549,0.00004273703,0.00003120574,0.00007243992,0.00008744874,0.07120513,0.001609711,0.9202763,0.006160432,0.00002993963],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2709596,0.007531215,0.5341552,0.02794021,0.001141127,0.0002652395,0.00237504,0.002434288,0.153198],"genre_scores_gemma":[0.902546,0.002130028,0.07294519,0.001967096,0.001390752,0.0003276168,0.001366302,0.0007718607,0.01655514],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01668262,"threshold_uncertainty_score":0.05580896,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07476690809554878,"score_gpt":0.3148013105240755,"score_spread":0.2400344024285267,"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."}}