{"id":"W2049140374","doi":"10.1016/j.tcs.2006.07.021","title":"Prime normal form and equivalence of simple grammars","year":2006,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Terminal and nonterminal symbols; Context-sensitive grammar; Indexed grammar; Tree-adjoining grammar; Mathematics; Context-free grammar; Prefix; Simple (philosophy); Discrete mathematics; Definite clause grammar; L-attributed grammar; Combinatorics; Equivalence (formal languages); Concatenation (mathematics); Logical equivalence; Computer science; Rule-based machine translation; Artificial intelligence; Linguistics","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.0008264725,0.0001440354,0.0001873507,0.0001255427,0.0002707212,0.0002283242,0.001793368,0.00003947982,0.00001603595],"category_scores_gemma":[0.00002665974,0.0001116064,0.00003815647,0.0006510639,0.002285143,0.001078799,0.002085469,0.0001114667,0.000008580975],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001986215,"about_ca_system_score_gemma":0.00007524554,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003805594,"about_ca_topic_score_gemma":8.897317e-7,"domain_scores_codex":[0.99804,0.00003853994,0.0002879885,0.0005430466,0.000619081,0.0004713048],"domain_scores_gemma":[0.9987479,0.0001529761,0.00009109102,0.0007070189,0.0001386367,0.0001623987],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003789231,0.00003926839,0.0002478061,0.00000719219,8.316151e-7,0.000004526963,0.00005939514,0.00003335873,0.001646216,0.9381379,0.00004626791,0.05977348],"study_design_scores_gemma":[0.0002001615,0.0001884173,0.006160177,0.00002251169,0.00000261715,0.00003878276,0.000001915581,0.5847942,0.01323455,0.3950151,0.0001660922,0.0001754246],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07566889,0.00004684548,0.9226489,0.0001535583,0.0001729906,0.00009738591,0.00000382564,0.00008282145,0.001124793],"genre_scores_gemma":[0.7562442,0.00000384029,0.2436113,0.00006979427,0.00005942609,0.000001724842,0.00000128264,0.000003337509,0.000005038857],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6805754,"threshold_uncertainty_score":0.8419705,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.005867900226174842,"score_gpt":0.2298530984603369,"score_spread":0.2239851982341621,"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."}}