{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003798262,0.00123322,0.001154806,0.001153412,0.001144687,0.00382284,0.0024025,0.001929591,0.01135541],"category_scores_gemma":[0.03275029,0.0006543651,0.001473085,0.002476068,0.002870602,0.007487534,0.003072487,0.002762998,0.00362076],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002588033,"about_ca_system_score_gemma":0.005298411,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002854875,"about_ca_topic_score_gemma":0.004500813,"domain_scores_codex":[0.9883221,0.003383738,0.000692481,0.001798065,0.004704108,0.00109953],"domain_scores_gemma":[0.9522758,0.03131918,0.001274255,0.01252953,0.002115806,0.0004854033],"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.002811683,0.001060858,0.004902356,0.002102842,0.0002106917,0.0006337406,0.001720935,0.1949535,0.03989726,0.1417766,0.0367307,0.5731989],"study_design_scores_gemma":[0.0004658788,0.000296377,0.001070231,0.0001125042,0.0001459753,0.0006034459,0.0005917971,0.5541814,0.04613303,0.3765655,0.01975612,0.0000777379],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2613254,0.002673919,0.6745232,0.005770652,0.0004208707,0.0007045805,0.002026065,0.02596439,0.02659088],"genre_scores_gemma":[0.5926849,0.000945275,0.3896025,0.0009200949,0.0001672675,0.0005199598,0.002721338,0.003401825,0.009036887],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01135541,"threshold_uncertainty_score":0.03798759,"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."}}