{"id":"W2025521996","doi":"10.1016/j.tcs.2004.02.032","title":"On the state complexity of reversals of regular languages","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":103,"is_retracted":false,"has_abstract":false,"ca_institutions":"Western University","funders":"","keywords":"Regular language; Variety (cybernetics); Finite-state machine; State (computer science); Deterministic finite automaton; Nondeterministic finite automaton; Mathematics; Automaton; Finite state; Discrete mathematics; Computer science; Theoretical computer science; Algorithm; Automata theory","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.003786319,0.000705508,0.00207307,0.001865988,0.001848933,0.006591196,0.002713078,0.002592255,0.01001211],"category_scores_gemma":[0.04039308,0.001134144,0.001687006,0.001844581,0.004753659,0.01686279,0.003822509,0.0054285,0.0005952989],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002648927,"about_ca_system_score_gemma":0.001699215,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002006033,"about_ca_topic_score_gemma":0.001832304,"domain_scores_codex":[0.9965854,0.001097128,0.000245697,0.000516514,0.0009078889,0.0006474087],"domain_scores_gemma":[0.8886279,0.09863131,0.003861961,0.004793499,0.0020269,0.002058438],"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.0009230719,0.000227215,0.004350541,0.0002416503,0.00007244809,0.0002622679,0.0009823656,0.0680748,0.003483574,0.9012039,0.003033128,0.01714503],"study_design_scores_gemma":[0.0000663212,0.00006126729,0.0009641165,0.00001972465,0.0000379036,0.00008500362,0.0001371177,0.1377611,0.0009102997,0.8593513,0.0005663488,0.0000394384],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.838025,0.001278409,0.1233501,0.004877187,0.0001564797,0.0001175293,0.0009531145,0.0005041488,0.03073814],"genre_scores_gemma":[0.9880474,0.0004011449,0.007271347,0.000165956,0.0001712905,0.00007287613,0.0004305629,0.0001401365,0.003299396],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01001211,"threshold_uncertainty_score":0.03349388,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01521811981985313,"score_gpt":0.2520598938413013,"score_spread":0.2368417740214482,"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."}}