{"id":"W2991381026","doi":"10.1016/j.tcs.2019.11.022","title":"Unique decipherability in formal languages","year":2019,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Chomsky hierarchy; Undecidable problem; Unique factorization domain; Combinatorics; Mathematics; Context (archaeology); Multiset; Factorization; Regular language; Word (group theory); Hierarchy; Context-free language; Formal language; Discrete mathematics; Philosophy of language; Computer science; Decidability; Artificial intelligence; Rule-based machine translation; Automaton; Philosophy; Algorithm","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002658019,0.0001482751,0.0001979573,0.0001658819,0.0001103518,0.0002721242,0.002576443,0.00005182723,0.0001617383],"category_scores_gemma":[0.00005943167,0.0001172976,0.00005075708,0.001083132,0.0009451724,0.001329864,0.001251206,0.0002086628,0.0002060215],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000750848,"about_ca_system_score_gemma":0.0001042961,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000896886,"about_ca_topic_score_gemma":0.000001570965,"domain_scores_codex":[0.9978538,0.0001361881,0.0002485189,0.0006488167,0.0004625644,0.00065011],"domain_scores_gemma":[0.9983923,0.0003294826,0.00004151773,0.001013881,0.0000648324,0.0001579496],"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.000004598999,0.00004304982,0.001095034,0.000005670421,7.561305e-7,0.000009413897,0.000359746,0.0001062282,0.001092483,0.944094,0.000005306633,0.05318368],"study_design_scores_gemma":[0.0003547617,0.0002029298,0.01935591,0.00003738115,7.995064e-7,0.00003336051,0.00002531708,0.6509535,0.006281514,0.3223651,0.0001176921,0.0002717547],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4925426,0.0000138628,0.5004293,0.0003036124,0.0002306348,0.0001278527,4.037138e-7,0.0001371563,0.00621465],"genre_scores_gemma":[0.928524,0.000001553098,0.0707121,0.0007000492,0.00003705471,0.000004598649,3.379422e-7,0.000004954776,0.00001532019],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6508473,"threshold_uncertainty_score":0.4787715,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.004845414963894193,"score_gpt":0.2447670603921896,"score_spread":0.2399216454282954,"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."}}