{"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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001923823,0.000125904,0.0002198223,0.0001058346,0.0001477621,0.00007219854,0.002775993,0.00002424594,0.00002943789],"category_scores_gemma":[0.0001365901,0.00007637068,0.00007495566,0.0008339825,0.006155908,0.0002320988,0.0007255087,0.0001236348,0.00001746413],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002869053,"about_ca_system_score_gemma":0.00007819841,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001679302,"about_ca_topic_score_gemma":4.58066e-7,"domain_scores_codex":[0.9982391,0.0001227407,0.0002842534,0.0003689864,0.00067395,0.0003109816],"domain_scores_gemma":[0.9981025,0.0004408742,0.0001365373,0.001090948,0.000137761,0.00009139721],"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.000006859019,0.00006278033,0.000003489387,0.000008168926,0.000003948789,0.000004388206,0.0007823117,0.0004871474,0.003898061,0.9905009,0.00001996004,0.00422193],"study_design_scores_gemma":[0.0001578647,0.0002063078,0.0005871889,0.00006880288,0.000002036402,0.000008685327,0.00001708642,0.0253466,0.1255782,0.8479343,0.000004775947,0.00008821042],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3601982,0.00002094887,0.6369161,0.001397813,0.0001083026,0.000101687,0.000003754652,0.00005624818,0.001196946],"genre_scores_gemma":[0.9362475,0.000002596685,0.06321209,0.0005101979,0.00001736362,0.000001533204,2.270994e-7,0.000004144418,0.000004391817],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5760492,"threshold_uncertainty_score":0.9965488,"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."}}