{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005074126,0.001103036,0.001428144,0.004011353,0.002220071,0.007083206,0.002284018,0.002267877,0.004817594],"category_scores_gemma":[0.01151817,0.0008531461,0.003097281,0.002718506,0.01239665,0.02144781,0.005920578,0.007884543,0.00137322],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003740607,"about_ca_system_score_gemma":0.002107542,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001221141,"about_ca_topic_score_gemma":0.0007693402,"domain_scores_codex":[0.9942135,0.002287888,0.0003909978,0.0008090713,0.001936564,0.0003619713],"domain_scores_gemma":[0.9914101,0.00610254,0.000380646,0.001123153,0.0007330328,0.0002505755],"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.000002886244,0.000003863275,0.00003846164,0.0000285232,0.000005939513,0.00001684497,0.00009124319,0.0008708932,0.0001109452,0.9952532,0.0005946201,0.002982509],"study_design_scores_gemma":[0.000004001839,0.000004434814,0.00002198385,0.00001482607,0.000003258922,0.00002718151,0.00001570874,0.004739427,0.0001124603,0.9885667,0.006480532,0.000009479315],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004643159,0.003804593,0.9612054,0.006843044,0.0004472972,0.00005382266,0.0001978278,0.000292534,0.02251234],"genre_scores_gemma":[0.3271563,0.008855376,0.6376897,0.00393265,0.004256607,0.0006042774,0.0005024808,0.0006775887,0.01632496],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007083206,"threshold_uncertainty_score":0.02714014,"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."}}