{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007846057,0.0003958134,0.0005449446,0.000607626,0.0005319336,0.002536994,0.0009485526,0.0005372162,0.003274528],"category_scores_gemma":[0.006274744,0.0002906916,0.000700585,0.0005397983,0.001439124,0.004235282,0.001216096,0.001094136,0.0003618975],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001324732,"about_ca_system_score_gemma":0.001026736,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001435564,"about_ca_topic_score_gemma":0.001406,"domain_scores_codex":[0.9982252,0.0002927504,0.0002298048,0.0003876406,0.0005320306,0.0003326366],"domain_scores_gemma":[0.9911072,0.005893327,0.000911778,0.0009255218,0.0007742064,0.0003880385],"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.000985819,0.0003071173,0.007869869,0.0004229035,0.00008437075,0.0005901788,0.001387044,0.3535213,0.06575863,0.5162373,0.001774148,0.05106124],"study_design_scores_gemma":[0.0000298794,0.000143159,0.001329897,0.00001907009,0.00003273833,0.0001238573,0.0001557427,0.7041426,0.01989406,0.2729401,0.001134533,0.00005434958],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8039731,0.0002236534,0.188909,0.0003524648,0.00003813607,0.00004920854,0.0005845624,0.000604037,0.005265818],"genre_scores_gemma":[0.979084,0.00009266368,0.01871749,0.00002912179,0.00001952197,0.0000600377,0.000535786,0.00005192273,0.001409503],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003274528,"threshold_uncertainty_score":0.01095438,"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."}}