{"id":"W1972680079","doi":"10.1142/s0129054107004930","title":"REDUCING SIMPLE GRAMMARS: EXPONENTIAL AGAINST HIGHLY-POLYNOMIAL TIME IN PRACTICE","year":2007,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Deterministic context-free grammar; Computer science; Concatenation (mathematics); Time complexity; Embedded pushdown automaton; Stateless protocol; Context-free grammar; Reduction (mathematics); Theoretical computer science; Simple (philosophy); Regular expression; Automaton; Algorithm; Rule-based machine translation; Artificial intelligence; State (computer science); Mathematics; Tree-adjoining grammar; Programming language; Arithmetic","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00285992,0.0001166429,0.0001890674,0.001073607,0.0001257637,0.0004477951,0.003200506,0.00003810555,0.000009237876],"category_scores_gemma":[0.0003730979,0.0001080058,0.00008769823,0.0008319984,0.0002359622,0.005255622,0.0007332998,0.0002143454,0.00001342571],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002194722,"about_ca_system_score_gemma":0.0005657742,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006360294,"about_ca_topic_score_gemma":0.000004849908,"domain_scores_codex":[0.9970976,0.00005760751,0.0009153314,0.0002821381,0.001383382,0.0002639896],"domain_scores_gemma":[0.9966513,0.0004109125,0.0008567189,0.000360146,0.001588559,0.0001323489],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001884668,0.0009805824,0.0006588613,0.000006250976,0.0000993355,0.0003381194,0.001949854,0.0188464,0.06553912,0.01863118,0.002650995,0.8901109],"study_design_scores_gemma":[0.00358977,0.0006969834,0.01951502,0.0004812824,0.00002639909,0.001226349,0.0001287938,0.8899685,0.03751578,0.004797408,0.04138098,0.000672689],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1125147,0.00003128592,0.8832625,0.001024399,0.00268495,0.00006356854,0.000003028101,0.00001548283,0.0004000329],"genre_scores_gemma":[0.595336,0.00001594292,0.4040218,0.0001598088,0.0004503823,4.341942e-7,0.000003697104,0.000003681486,0.00000828047],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8894382,"threshold_uncertainty_score":0.594739,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01214456559966117,"score_gpt":0.3097641525055355,"score_spread":0.2976195869058743,"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."}}