{"id":"W2953014553","doi":"","title":"A New Approach to Formal Language Theory by Kolmogorov Complexity","year":2001,"lang":"en","type":"preprint","venue":"","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Army Research Office; Office of Naval Research; Natural Sciences and Engineering Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; National Science Foundation","keywords":"Nondeterministic algorithm; Formal language; Chomsky hierarchy; Kolmogorov complexity; Lemma (botany); Computer science; Hierarchy; Context (archaeology); Context-free language; Regular language; Theory; Theoretical computer science; Mathematics; Algorithm; Programming language; Artificial intelligence; Rule-based machine translation; Automaton","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":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.001542253,0.0006549989,0.0007543261,0.0002218228,0.0001649829,0.0006871197,0.005323499,0.000376929,0.0004756841],"category_scores_gemma":[0.0001034983,0.0005846272,0.0003313187,0.0005684213,0.0001013352,0.0003937685,0.01211516,0.0009514883,0.0003935723],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002756076,"about_ca_system_score_gemma":0.0003690111,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001829344,"about_ca_topic_score_gemma":0.00007063225,"domain_scores_codex":[0.9953247,0.0003591143,0.000617174,0.001917243,0.0007748833,0.001006851],"domain_scores_gemma":[0.9956192,0.0002289095,0.0001846673,0.00317927,0.0001283242,0.0006596562],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003769592,0.0009148144,0.0001295648,0.0001814608,0.00012302,0.00003361849,0.007244981,0.002675678,0.00006152463,0.3499556,0.09492681,0.5437152],"study_design_scores_gemma":[0.0012075,0.000249805,0.002238851,0.00006994103,0.00005175055,0.0002055585,0.000551531,0.4638658,0.0006071874,0.5026034,0.02538483,0.002963909],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001471617,0.0002311279,0.8492343,0.0007945045,0.0007977025,0.001032652,0.00003122695,0.001018594,0.1453883],"genre_scores_gemma":[0.03092143,0.00000789601,0.953319,0.001776455,0.0005217945,0.00008915192,0.0001011428,0.00004239994,0.0132208],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5407513,"threshold_uncertainty_score":0.9996605,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04129446725237853,"score_gpt":0.281186732629208,"score_spread":0.2398922653768295,"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."}}