{"id":"W2771131742","doi":"10.1007/s00224-018-9871-4","title":"Better Complexity Bounds for Cost Register Automata","year":2018,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Deutsche Forschungsgemeinschaft; National Science Foundation","keywords":"Register (sociolinguistics); Computer science; Automaton; Register allocation; Theoretical computer science; Arithmetic; Parallel computing; Mathematics; Programming language","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003093513,0.0002225726,0.0004613351,0.0001255485,0.0003150076,0.0002321259,0.001567219,0.00008799206,0.000009639244],"category_scores_gemma":[0.00007983511,0.0001963334,0.000140195,0.0002354807,0.0005298075,0.0002463972,0.0003942485,0.00009494785,0.00005591461],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004874157,"about_ca_system_score_gemma":0.00004946549,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002373422,"about_ca_topic_score_gemma":0.000001556481,"domain_scores_codex":[0.9978164,0.0003635891,0.0005945046,0.0004679032,0.0002979063,0.0004597104],"domain_scores_gemma":[0.9972486,0.0007590906,0.0004375602,0.001219657,0.0002447506,0.00009030729],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000332155,0.00005739305,0.0001022264,0.0001700755,0.00005202033,0.000001924524,0.00162645,0.0000252303,0.0007267817,0.9716445,0.005082177,0.02047797],"study_design_scores_gemma":[0.001694083,0.000547828,0.002373405,0.0006895795,0.00003293639,0.0001355424,0.0002875392,0.7205303,0.003300467,0.2370082,0.03270748,0.0006925691],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09466495,0.0001149942,0.8965462,0.0002736734,0.002011713,0.0005568938,0.00001560088,0.0004898696,0.005326093],"genre_scores_gemma":[0.9763448,4.877637e-7,0.02196532,0.0004855585,0.0007268988,0.00001332823,0.000006985785,0.00002475212,0.0004319172],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8816798,"threshold_uncertainty_score":0.8006245,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05901425934316849,"score_gpt":0.2955452278681961,"score_spread":0.2365309685250276,"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."}}