{"id":"W2403784750","doi":"","title":"Transition Complexity of Language Operations.","year":2006,"lang":"en","type":"article","venue":"DCFS","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University; University of Manitoba","funders":"","keywords":"Nondeterministic finite automaton; Nondeterministic algorithm; Regular language; Computer science; Deterministic finite automaton; State (computer science); Regular expression; Finite-state machine; Automaton; Mathematics; Theoretical computer science; Programming language; 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":[],"consensus_categories":[],"category_scores_codex":[0.00007992967,0.00003330526,0.00005323561,0.00002540348,0.00003235955,0.00002277892,0.0001663165,0.00001444279,0.00003264566],"category_scores_gemma":[0.000002057046,0.00002995599,0.00002361654,0.00009551347,0.00003628346,0.0001449913,0.00001745843,0.00002235507,0.00001826194],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000532919,"about_ca_system_score_gemma":0.000008011032,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003062591,"about_ca_topic_score_gemma":0.00003946518,"domain_scores_codex":[0.9996808,0.00002150081,0.00008482157,0.00008106475,0.00007109057,0.00006067677],"domain_scores_gemma":[0.9997779,0.00001056074,0.00001280245,0.0001722211,0.00001601448,0.00001046806],"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.000001259853,0.00005092389,0.00002532355,0.000008880815,0.000002600943,0.000004815425,0.001300412,0.0005277494,0.03930215,0.9499993,0.0005915034,0.00818509],"study_design_scores_gemma":[0.0009799965,0.0001123209,0.02999721,0.00004633255,0.00001095792,0.00003462034,0.0004067514,0.5968422,0.2529487,0.1160229,0.00220013,0.0003979167],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4669541,0.00008993768,0.5284825,0.0006685391,0.00006106551,0.00004374123,0.000007806638,0.00009037922,0.003601965],"genre_scores_gemma":[0.9808871,5.814962e-7,0.01885009,0.0001305004,0.00004501527,0.000001711005,0.00001229865,0.000001785283,0.00007091332],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8339764,"threshold_uncertainty_score":0.122157,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01385649125563036,"score_gpt":0.233511927603605,"score_spread":0.2196554363479746,"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."}}