{"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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001459728,0.0001828298,0.0002637272,0.0001842569,0.0002927144,0.0003410987,0.003074275,0.00003540679,0.00004989329],"category_scores_gemma":[0.00006147287,0.0001478519,0.0000683698,0.001258079,0.003357996,0.0009387162,0.0006662856,0.0001470128,0.00004410922],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003805849,"about_ca_system_score_gemma":0.0001697483,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003535431,"about_ca_topic_score_gemma":2.801405e-7,"domain_scores_codex":[0.9975449,0.0001222131,0.0003941501,0.000612529,0.0008301284,0.0004960272],"domain_scores_gemma":[0.9982781,0.0001679954,0.0001011224,0.0009899883,0.000233172,0.0002295944],"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.000007015777,0.000103676,0.00001523752,0.000002953362,0.000002083251,0.000006684172,0.0002682957,0.0001594167,0.002028051,0.9085039,0.00005248618,0.08885019],"study_design_scores_gemma":[0.0001840859,0.0001699378,0.008687686,0.00001939303,0.000001410335,0.0000277612,0.000001906865,0.5149229,0.006288423,0.4695231,0.00003442853,0.0001389525],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.133635,0.00001570466,0.8614985,0.002390257,0.0002887552,0.000129295,0.000004049328,0.0002896219,0.001748763],"genre_scores_gemma":[0.7929554,0.000001956646,0.2059199,0.001064514,0.0000446821,0.000001340899,0.000001497941,0.000003464954,0.000007281242],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6593204,"threshold_uncertainty_score":0.9993543,"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."}}