{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003864914,0.001089449,0.001465811,0.002205495,0.001572676,0.006934309,0.002763623,0.002100264,0.01566358],"category_scores_gemma":[0.0253401,0.0006799997,0.002707923,0.002110015,0.003840841,0.01974069,0.004627717,0.008555123,0.001795799],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005623934,"about_ca_system_score_gemma":0.002044415,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002361029,"about_ca_topic_score_gemma":0.0023526,"domain_scores_codex":[0.9940037,0.001171432,0.0003306363,0.00153093,0.002072886,0.0008903479],"domain_scores_gemma":[0.9599516,0.02983099,0.001317925,0.006057607,0.001752029,0.001089882],"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.0002608459,0.0001161359,0.001357909,0.0002633843,0.00004037558,0.00009069705,0.0003923936,0.02258723,0.003039022,0.948894,0.005806607,0.01715144],"study_design_scores_gemma":[0.00003238782,0.00005114242,0.000478357,0.00004046188,0.00003689775,0.00007440844,0.00008625326,0.09174505,0.002005499,0.8997364,0.0056807,0.00003231359],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3262532,0.006434718,0.5071247,0.02368922,0.0008663043,0.0002754308,0.002537504,0.002667264,0.1301517],"genre_scores_gemma":[0.9151511,0.001715418,0.06332113,0.001428883,0.001073742,0.0003075463,0.001333177,0.0006722307,0.01499681],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01566358,"threshold_uncertainty_score":0.05239993,"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."}}