{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003444243,0.0006520922,0.001863067,0.001743502,0.00175476,0.008229125,0.002810506,0.001946525,0.008083137],"category_scores_gemma":[0.02383584,0.000849807,0.002294033,0.001665573,0.004102177,0.01605465,0.00320556,0.003901866,0.0004688909],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003900476,"about_ca_system_score_gemma":0.002692916,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003533142,"about_ca_topic_score_gemma":0.002874075,"domain_scores_codex":[0.993846,0.001393188,0.0005198537,0.00113792,0.00181014,0.001292803],"domain_scores_gemma":[0.9522688,0.03803641,0.002556781,0.003687597,0.002045256,0.001405175],"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.0005927876,0.0001988574,0.003890574,0.0002211248,0.00009042547,0.000283244,0.001271082,0.06953426,0.003564811,0.9048467,0.001319263,0.01418683],"study_design_scores_gemma":[0.00004595961,0.0000404443,0.0006906241,0.00002000123,0.00004691764,0.0000883298,0.0001403608,0.1481396,0.001701427,0.8485956,0.0004531286,0.0000375076],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.815486,0.000412396,0.1651677,0.002154836,0.00006605303,0.00009217051,0.0008593757,0.0004976683,0.01526375],"genre_scores_gemma":[0.9897805,0.0001175901,0.007703299,0.00007538417,0.00006843871,0.00006054411,0.0003485954,0.00007403221,0.001771516],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008229125,"threshold_uncertainty_score":0.02830011,"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."}}