{"id":"W1980577621","doi":"10.1142/s012905410400242x","title":"ON THE PALINDROMIC COMPLEXITY OF INFINITE WORDS","year":2004,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":106,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University; Université du Québec à Montréal","funders":"","keywords":"Palindrome; Mathematics; Combinatorics on words; Set (abstract data type); Product (mathematics); Enumeration; Simple (philosophy); Combinatorics; Existential quantification; Discrete mathematics; Word (group theory); Computer science","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.001316542,0.0004778468,0.0009281465,0.001367556,0.001293887,0.003640761,0.001187078,0.001418074,0.004308236],"category_scores_gemma":[0.01328376,0.000660231,0.0008240293,0.001351218,0.003605915,0.006949874,0.001882669,0.001964067,0.0004917739],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001561082,"about_ca_system_score_gemma":0.0005630857,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005779496,"about_ca_topic_score_gemma":0.0005203598,"domain_scores_codex":[0.9986225,0.0003461805,0.0001261686,0.0003197287,0.0004015906,0.0001838735],"domain_scores_gemma":[0.9851665,0.01219413,0.001103122,0.0006125353,0.000555089,0.0003685936],"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.0001776874,0.00008867344,0.001910393,0.0003330489,0.00002410232,0.0004597357,0.001612781,0.02608203,0.006284865,0.9439925,0.0008164374,0.0182178],"study_design_scores_gemma":[0.00003507749,0.00007488931,0.0006257821,0.00005044958,0.00001866287,0.0002558623,0.0002448566,0.03422474,0.002445436,0.9596136,0.002380346,0.00003017289],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7932621,0.001697415,0.168922,0.002312523,0.00006894378,0.0001030328,0.000323506,0.0001848652,0.03312578],"genre_scores_gemma":[0.9617866,0.0007426891,0.03091213,0.000163393,0.0002109888,0.000136935,0.000388357,0.00006923293,0.005589597],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004308236,"threshold_uncertainty_score":0.01441246,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03640076233099542,"score_gpt":0.301955305417043,"score_spread":0.2655545430860475,"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."}}