{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000652393,0.0004142174,0.0006386714,0.000620059,0.0006277499,0.001349812,0.0005687317,0.0004646132,0.003079185],"category_scores_gemma":[0.004437581,0.0003598117,0.0006097499,0.000606771,0.001269331,0.002581938,0.00126482,0.000898827,0.0007923907],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001018986,"about_ca_system_score_gemma":0.001223296,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001165299,"about_ca_topic_score_gemma":0.00129792,"domain_scores_codex":[0.9992494,0.0001457253,0.00006783449,0.0002387242,0.0001818787,0.0001164347],"domain_scores_gemma":[0.9976752,0.001310842,0.0002088113,0.0004421521,0.0002557653,0.0001070802],"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.001087141,0.0002010579,0.003378849,0.00056982,0.00005556472,0.000550952,0.001196026,0.1035355,0.05299265,0.4915439,0.006425318,0.3384632],"study_design_scores_gemma":[0.00005338733,0.0001439581,0.0003550221,0.00003353768,0.0000372816,0.0003583632,0.000192837,0.4210829,0.03446213,0.5355828,0.007668386,0.00002934768],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.111299,0.0002692683,0.8803105,0.0003226206,0.00003454743,0.0001118839,0.0002220088,0.001958105,0.005472058],"genre_scores_gemma":[0.545537,0.0002028933,0.4468922,0.0001239746,0.00003941951,0.0001335512,0.0008812104,0.0002220715,0.005967649],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003079185,"threshold_uncertainty_score":0.01030087,"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."}}