{"id":"W2046033718","doi":"10.1142/s0129054103002151","title":"LINEAR-TIME PRIME DECOMPOSITION OF REGULAR PREFIX CODES","year":2003,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Prefix code; Concatenation (mathematics); Prefix; Prime (order theory); Mathematics; Discrete mathematics; Regular language; Combinatorics; Linear code; Automaton; Computer science; Algorithm; Theoretical computer science; Block code; Decoding methods","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.001483502,0.00009876275,0.000211608,0.000568913,0.00008627393,0.0001538126,0.002407746,0.00002910886,0.00002980667],"category_scores_gemma":[0.0001558401,0.00008794754,0.0001243761,0.0005697915,0.0003704482,0.001794228,0.0002068524,0.00009416793,0.000009472639],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007891784,"about_ca_system_score_gemma":0.0004251011,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004107853,"about_ca_topic_score_gemma":3.030716e-7,"domain_scores_codex":[0.9978506,0.00008688815,0.0006906539,0.0001908264,0.001037379,0.0001436812],"domain_scores_gemma":[0.9966021,0.0001973282,0.000840374,0.0003450682,0.001934564,0.00008063509],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00004245389,0.0008694023,0.001068124,0.00001847729,0.0002158678,0.00002575386,0.001228986,0.01269202,0.2527564,0.6150313,0.000422914,0.1156283],"study_design_scores_gemma":[0.001356281,0.000687817,0.01158324,0.000427276,0.00002938839,0.001021304,0.00002494062,0.3706021,0.5291335,0.08227029,0.002520356,0.0003434848],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1755508,0.0000490782,0.8225799,0.0003825524,0.0009837509,0.00004840969,0.000002961615,0.00001410069,0.0003884519],"genre_scores_gemma":[0.6478011,0.000009047689,0.3520528,0.00004968327,0.00006584531,4.729499e-7,0.000001005234,0.000002765134,0.00001722978],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.532761,"threshold_uncertainty_score":0.4474232,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009870597442700342,"score_gpt":0.2953084454662966,"score_spread":0.2854378480235963,"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."}}