{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00128672,0.0000868381,0.0001578198,0.0004570236,0.0001123564,0.0001905739,0.004043789,0.00001890352,0.0000214463],"category_scores_gemma":[0.0001758714,0.0000598622,0.0001185734,0.0006146571,0.000921796,0.0009339536,0.0003561817,0.0001420917,0.00000856442],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009108692,"about_ca_system_score_gemma":0.0004844705,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001736568,"about_ca_topic_score_gemma":0.000002285132,"domain_scores_codex":[0.9980136,0.00004386978,0.0005748803,0.0001473013,0.001094249,0.0001261467],"domain_scores_gemma":[0.9974175,0.0003462192,0.0007314147,0.0003838768,0.001065108,0.00005585931],"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.00001036425,0.0001452764,0.00008429526,0.000001831836,0.00003169762,0.000005317605,0.0006497346,0.008763928,0.001845656,0.9743941,0.00004535182,0.01402238],"study_design_scores_gemma":[0.001059328,0.0005105085,0.02051703,0.0003584225,0.000009362366,0.0003063214,0.00004963679,0.05912041,0.02570017,0.8918371,0.0003567259,0.0001749296],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3585956,0.00001297536,0.6363704,0.003543126,0.001151195,0.00003795069,0.000002875083,0.000007745337,0.0002780675],"genre_scores_gemma":[0.9106402,0.000007519161,0.0889467,0.0003082253,0.00009085509,5.748906e-7,3.964242e-7,0.000002386929,0.000003101818],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5520446,"threshold_uncertainty_score":0.7514433,"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."}}