{"id":"W2940923581","doi":"10.4230/lipics.mfcs.2017.24","title":"Better Complexity Bounds for Cost Register Automata","year":2017,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Register (sociolinguistics); Automaton; Register allocation; Theoretical computer science; Parallel computing; Programming language","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.003632986,0.001107459,0.001423461,0.002100958,0.001490549,0.006812708,0.002868405,0.001952896,0.01650153],"category_scores_gemma":[0.02377917,0.0006802736,0.002580378,0.002119276,0.003835168,0.02025695,0.004626765,0.008500534,0.001951352],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005898189,"about_ca_system_score_gemma":0.002092529,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002424794,"about_ca_topic_score_gemma":0.002553266,"domain_scores_codex":[0.993997,0.001142549,0.0003334189,0.001602525,0.001975326,0.0009492475],"domain_scores_gemma":[0.964443,0.02591416,0.001218144,0.005747223,0.00165051,0.001027038],"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.0002607069,0.0001122788,0.00120729,0.0002552551,0.00003757792,0.00008596898,0.0003697707,0.02412449,0.003110139,0.9464548,0.0057006,0.01828105],"study_design_scores_gemma":[0.00003106572,0.00005551908,0.0004277674,0.00004461623,0.00003788394,0.0000707878,0.0000909529,0.1004801,0.002235393,0.8901053,0.006387843,0.00003282324],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2924601,0.00634948,0.5399512,0.02126654,0.0008643462,0.0002699712,0.002578541,0.003080592,0.1331792],"genre_scores_gemma":[0.9083363,0.001793158,0.06814167,0.001536919,0.000949505,0.0003151969,0.001398547,0.0008223768,0.01670643],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01650153,"threshold_uncertainty_score":0.05520308,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06230586614724938,"score_gpt":0.3169479117971421,"score_spread":0.2546420456498927,"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."}}