{"id":"W1483785569","doi":"10.1007/11812128_10","title":"Reducing Simple Grammars: Exponential Against Highly-Polynomial Time in Practice","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Computer science; Concatenation (mathematics); Deterministic context-free grammar; Embedded pushdown automaton; Time complexity; Theoretical computer science; Simple (philosophy); Reduction (mathematics); Context-free grammar; Stateless protocol; Pushdown automaton; Algorithm; Rule-based machine translation; Automaton; Artificial intelligence; State (computer science); Tree-adjoining grammar; Mathematics; 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.005899181,0.001752327,0.002112232,0.001372954,0.0022853,0.005921836,0.005146433,0.002913285,0.01823991],"category_scores_gemma":[0.04273243,0.001520901,0.002883812,0.003579188,0.005131539,0.01857171,0.0104546,0.00931468,0.006758852],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00335297,"about_ca_system_score_gemma":0.005213988,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002782687,"about_ca_topic_score_gemma":0.004802824,"domain_scores_codex":[0.9863019,0.004003059,0.0008318371,0.002375046,0.004930874,0.001557256],"domain_scores_gemma":[0.9417112,0.03326213,0.00106112,0.02043257,0.002666656,0.0008664022],"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.001640379,0.0007880554,0.002017589,0.001184764,0.0002058082,0.0003577557,0.002043201,0.04450434,0.01267795,0.559404,0.05132533,0.3238508],"study_design_scores_gemma":[0.0001480992,0.000069364,0.0001963194,0.00005237517,0.00008230536,0.0001819008,0.0002870603,0.05880918,0.00541374,0.9237829,0.01094761,0.00002907843],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.09129129,0.002097927,0.8207908,0.01301778,0.0007244447,0.0004351801,0.001134161,0.01370281,0.05680573],"genre_scores_gemma":[0.5194571,0.001546822,0.4407853,0.002383038,0.0007525011,0.0005542951,0.002076039,0.005826715,0.02661825],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01823991,"threshold_uncertainty_score":0.06101859,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008559549543281935,"score_gpt":0.2297447781685894,"score_spread":0.2211852286253075,"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."}}