{"id":"W1996644214","doi":"10.1016/j.tcs.2009.05.002","title":"Operational 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":31,"is_retracted":false,"has_abstract":false,"ca_institutions":"Queen's University","funders":"","keywords":"Concatenation (mathematics); Finite-state machine; Nested word; Quantum finite automata; Discrete mathematics; Mathematics; Automaton; Upper and lower bounds; Word (group theory); Constant (computer programming); Deterministic finite automaton; Combinatorics; State (computer science); Automata theory; Computer science; Theoretical computer science; Algorithm","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.00193214,0.0004931128,0.001349869,0.001414538,0.001365153,0.006104557,0.001822716,0.001358376,0.008040627],"category_scores_gemma":[0.01476147,0.0006173339,0.001321188,0.001444966,0.003479432,0.01302224,0.002817536,0.003141959,0.0004981369],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002387068,"about_ca_system_score_gemma":0.001574901,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002294816,"about_ca_topic_score_gemma":0.001835954,"domain_scores_codex":[0.9964421,0.0008001403,0.0002885143,0.000655567,0.00124116,0.000572468],"domain_scores_gemma":[0.9733611,0.02087218,0.001265363,0.001848779,0.00164578,0.001006826],"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.0001771936,0.00008560581,0.001330772,0.00007354713,0.00002410063,0.0001385337,0.0008436439,0.01814735,0.002201131,0.9689187,0.000752442,0.007307054],"study_design_scores_gemma":[0.00001719071,0.00001964998,0.000347076,0.000007960006,0.00001425278,0.00004666311,0.0001061979,0.07488458,0.0008383927,0.923249,0.0004488451,0.00002013209],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7710022,0.0004637515,0.204544,0.001806417,0.00007540739,0.00007951926,0.0007900574,0.000343929,0.02089465],"genre_scores_gemma":[0.9866216,0.0001590083,0.009344747,0.00007255476,0.00007451978,0.00007396701,0.0004056524,0.00007170893,0.003176283],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008040627,"threshold_uncertainty_score":0.02689862,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01945393435818284,"score_gpt":0.2631941083867752,"score_spread":0.2437401740285924,"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."}}