{"id":"W2595036685","doi":"10.1016/j.tcs.2017.03.007","title":"State complexity of permutation on finite languages over a binary alphabet","year":2017,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Ministry of Education, Science and Technology; Ministry of Science, ICT and Future Planning","keywords":"Deterministic finite automaton; Combinatorics; Mathematics; Permutation (music); Regular language; Modulo; Nondeterministic finite automaton; Finite-state machine; Discrete mathematics; Deterministic automaton; State (computer science); DFA minimization; Cyclic permutation; Alphabet; String (physics); Binary number; Automaton; Automata theory; Algorithm; Computer science; Arithmetic; Symmetric group; Theoretical computer science; Physics","routes":{"ca_aff":true,"ca_fund":true,"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.001231218,0.0001669839,0.000227958,0.000156373,0.0006528707,0.0005310315,0.003424428,0.00003405167,0.00004263139],"category_scores_gemma":[0.0001771622,0.0001315192,0.00007161737,0.0002583273,0.005182185,0.0008730564,0.001271532,0.0001469036,0.0000476882],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003056156,"about_ca_system_score_gemma":0.00007085868,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001613068,"about_ca_topic_score_gemma":8.452282e-7,"domain_scores_codex":[0.9980351,0.0001003698,0.0002456328,0.0005612097,0.000653517,0.0004041627],"domain_scores_gemma":[0.9976299,0.0003212153,0.0002032847,0.001567515,0.0001200667,0.0001579639],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001429791,0.00007856145,0.0001571021,0.000009752908,0.000003940192,0.00001981533,0.0005816292,0.0002065838,0.001704947,0.9696143,0.00004214045,0.02756699],"study_design_scores_gemma":[0.0002816248,0.0003184402,0.04103468,0.00006049391,0.000002739208,0.000006918321,0.000007367698,0.6190563,0.01030207,0.3287255,0.00002441738,0.0001794514],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4646541,0.00001328854,0.5299173,0.0007737397,0.0003244328,0.0001108031,0.000009802921,0.000118534,0.004078026],"genre_scores_gemma":[0.9634237,0.000003206331,0.03603537,0.0004552915,0.00005555016,0.000002872039,0.000001256235,0.000006668154,0.00001612148],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6408888,"threshold_uncertainty_score":0.9975252,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02300317871010646,"score_gpt":0.2986228897265871,"score_spread":0.2756197110164806,"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."}}