{"id":"W847683642","doi":"10.1016/j.tcs.2015.07.006","title":"Operational state complexity of unary NFAs with finite nondeterminism","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"Queen's University","funders":"National Science Council","keywords":"Unary operation; Concatenation (mathematics); TRACE (psycholinguistics); Regular language; State (computer science); Discrete mathematics; Upper and lower bounds; Property (philosophy); Mathematics; Tree (set theory); Computer science; Combinatorics; Finite-state machine; Algorithm; Theoretical computer science; 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.001577405,0.0001839887,0.0002512567,0.0001577242,0.0001939513,0.0002643225,0.002321956,0.00003103921,0.00002532219],"category_scores_gemma":[0.00005938448,0.0001309722,0.00004179871,0.0008839383,0.005792852,0.0008919185,0.001007077,0.0001473269,0.00004470843],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004040778,"about_ca_system_score_gemma":0.0004177975,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006993987,"about_ca_topic_score_gemma":7.552085e-7,"domain_scores_codex":[0.9975665,0.0001288091,0.0003091654,0.0005820496,0.0009750124,0.0004385182],"domain_scores_gemma":[0.9980909,0.0002494375,0.0001002898,0.0008266799,0.0003707116,0.0003619374],"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.00002205137,0.00007723211,0.000107171,0.000005173225,0.000004316451,0.00002290931,0.0008933781,0.0009790703,0.000259633,0.9898968,0.00003828468,0.00769393],"study_design_scores_gemma":[0.0003595774,0.0005095421,0.001080145,0.0000272392,0.000002405352,0.00006597055,0.00001076419,0.6284091,0.005368815,0.3639375,0.00004643262,0.0001824327],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1207852,0.00001366975,0.875298,0.0006816927,0.0002617952,0.0001187238,0.000006055971,0.0001288407,0.002706022],"genre_scores_gemma":[0.7580152,6.943121e-7,0.2413653,0.0005561758,0.00004167575,0.000003256253,0.000001464052,0.000005709606,0.00001050905],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.63723,"threshold_uncertainty_score":0.9969128,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03340567686188543,"score_gpt":0.2602477206608893,"score_spread":0.2268420437990039,"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."}}