{"id":"W2907458073","doi":"10.1016/j.tcs.2018.12.025","title":"Syntactic complexity of bifix-free regular 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":"Narodowe Centrum Nauki","keywords":"Injective function; Cardinality (data modeling); Mathematics; Regular language; Alphabet; Upper and lower bounds; Combinatorics; Discrete mathematics; Function (biology); Semigroup; Computer science; Theoretical computer science; Linguistics; Automaton","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":["sts"],"consensus_categories":[],"category_scores_codex":[0.001582267,0.0001824796,0.0003132822,0.0001997411,0.00014709,0.0002077543,0.005018829,0.0000516559,0.0001694994],"category_scores_gemma":[0.0001176191,0.0001449853,0.00009384627,0.001075618,0.003363598,0.000719736,0.002197936,0.0001674175,0.0001783241],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003892279,"about_ca_system_score_gemma":0.00009622728,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009970114,"about_ca_topic_score_gemma":3.655166e-7,"domain_scores_codex":[0.9975458,0.0001303048,0.0003093318,0.000680977,0.0008178207,0.0005156987],"domain_scores_gemma":[0.9969748,0.0003241148,0.0001207265,0.002240069,0.00015155,0.0001887828],"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.000005762657,0.0000560154,0.0001490781,0.0000214948,0.000004782348,0.000007455967,0.0002367162,0.00002490858,0.006442904,0.9845859,0.00004883595,0.008416146],"study_design_scores_gemma":[0.0003415185,0.0002464578,0.003744693,0.00006698901,0.000005093204,0.00005541412,0.00002943703,0.2994718,0.03788737,0.6578227,0.00006527147,0.0002632709],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3343949,0.00005802766,0.65611,0.001067244,0.0005234227,0.0001829581,0.000003739219,0.0002399002,0.007419789],"genre_scores_gemma":[0.8707378,0.000002121217,0.1288297,0.000349376,0.00005102003,0.0000018975,5.830858e-7,0.000007364592,0.00002007353],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5363429,"threshold_uncertainty_score":0.9993487,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01135917003010243,"score_gpt":0.2460149661054134,"score_spread":0.234655796075311,"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."}}