{"id":"W2061265323","doi":"10.1016/j.tcs.2009.01.004","title":"Nondeterministic state complexity of nested word automata","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Nondeterministic algorithm; Nondeterministic finite automaton; Nested word; Word (group theory); Discrete mathematics; Deterministic finite automaton; Intersection (aeronautics); Mathematics; Upper and lower bounds; Combinatorics; Automaton; Finite-state machine; Automata theory; Computer science; Quantum finite automata; Theoretical computer science; Algorithm","routes":{"ca_aff":true,"ca_fund":true,"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.001501939,0.000238478,0.0003680658,0.0002392499,0.0002726357,0.0003258452,0.003993199,0.00004465309,0.00003269198],"category_scores_gemma":[0.00008873588,0.0001958496,0.00009173799,0.001482425,0.004546034,0.0007285162,0.0008587042,0.0001805968,0.00005496908],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004195047,"about_ca_system_score_gemma":0.0001548656,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002981762,"about_ca_topic_score_gemma":2.709643e-7,"domain_scores_codex":[0.9971207,0.0001382364,0.0004817719,0.0007484919,0.0008336797,0.0006770669],"domain_scores_gemma":[0.9976262,0.0002612574,0.0001609014,0.001456122,0.0001910384,0.0003045107],"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.000009147183,0.0001109266,0.00001161995,0.000006455495,0.000002133831,0.00001996737,0.0002948852,0.00004146715,0.001752452,0.8395352,0.00002468792,0.1581911],"study_design_scores_gemma":[0.0002111497,0.0003025186,0.006593481,0.00003476009,0.00000289492,0.00004761076,0.000002409938,0.4817204,0.005365743,0.5055069,0.00002595555,0.0001861694],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1645301,0.00001448624,0.8314056,0.0009713907,0.0003759408,0.0001506009,0.000004199971,0.0003976738,0.00214993],"genre_scores_gemma":[0.851755,0.000002298524,0.1474591,0.0007244733,0.00004315397,0.000001559421,8.931793e-7,0.000005467889,0.00000803866],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6872249,"threshold_uncertainty_score":0.998163,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01999266988656173,"score_gpt":0.2667129231920374,"score_spread":0.2467202533054757,"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."}}