{"id":"W3121898969","doi":"","title":"Operational state complexity of deterministic unranked tree automata","year":2016,"lang":"en","type":"article","venue":"","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"","keywords":"Concatenation (mathematics); Tree (set theory); Regular language; Combinatorics; String (physics); Intersection (aeronautics); Tree automaton; State (computer science); Discrete mathematics; Automaton; Deterministic finite automaton; Mathematics; Upper and lower bounds; Time complexity; 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":[],"consensus_categories":[],"category_scores_codex":[0.0002141308,0.0000874217,0.0001350138,0.00004885861,0.00005004408,0.00004230265,0.0006736328,0.00001981803,0.0001911533],"category_scores_gemma":[0.00003603285,0.0000516801,0.00004181874,0.0001056752,0.0001671668,0.0003427284,0.0001991465,0.00002189024,0.00009965222],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001563696,"about_ca_system_score_gemma":0.00005962379,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002070585,"about_ca_topic_score_gemma":0.00002017247,"domain_scores_codex":[0.9991384,0.00005166228,0.0002294992,0.0002189053,0.0002016569,0.0001599118],"domain_scores_gemma":[0.9991685,0.0001762577,0.00006136564,0.0004813629,0.00005495351,0.00005754235],"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.000007718315,0.00007594317,0.0002816131,0.000008916791,0.00001319788,0.000007490245,0.0001276421,0.000003347898,0.02156229,0.8420341,0.0009312009,0.1349466],"study_design_scores_gemma":[0.002881575,0.000399183,0.1093376,0.0001180368,0.00001096597,0.00007265125,0.00002109691,0.3091673,0.08208461,0.4919126,0.003350524,0.0006437426],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1148379,0.000009415592,0.8769954,0.00155303,0.0001624886,0.00008674147,0.00002530511,0.000247846,0.006081848],"genre_scores_gemma":[0.9607346,0.00000313994,0.03798128,0.0002561742,0.00001596361,0.000004136319,0.000001672398,0.000004390319,0.0009986266],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8458968,"threshold_uncertainty_score":0.2107453,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03509262192747717,"score_gpt":0.2554535460084224,"score_spread":0.2203609240809452,"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."}}