{"id":"W2342016401","doi":"","title":"State Complexity of Unranked Tree Automata","year":2010,"lang":"en","type":"article","venue":"","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"","keywords":"Nondeterministic algorithm; Tree (set theory); Tree automaton; Automaton; State (computer science); String (physics); Nondeterministic finite automaton; Computer science; Mathematics; Combinatorics; Deterministic finite automaton; Discrete mathematics; Theoretical computer science; Automata theory; 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.001044472,0.0004370998,0.0006705432,0.001081668,0.0007543079,0.00353672,0.001289871,0.0008974278,0.005873323],"category_scores_gemma":[0.00820495,0.0003631342,0.001116495,0.000985418,0.00190609,0.006585802,0.001664791,0.001829148,0.000515727],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001841101,"about_ca_system_score_gemma":0.0007520531,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001339807,"about_ca_topic_score_gemma":0.001394235,"domain_scores_codex":[0.9974866,0.0005186747,0.0002388431,0.0005149884,0.0008985497,0.0003421952],"domain_scores_gemma":[0.989813,0.007138778,0.0007848804,0.001079259,0.000881721,0.0003022545],"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.000250709,0.0001140221,0.002061818,0.0002748177,0.00005119117,0.0003588297,0.0007052699,0.1312271,0.009716253,0.8262795,0.001377934,0.02758259],"study_design_scores_gemma":[0.0000198968,0.00004471002,0.0003653125,0.00001725141,0.00002559428,0.0000887706,0.00005796224,0.3449586,0.004796983,0.6483644,0.001232022,0.00002851243],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5858249,0.0005384499,0.3966846,0.0009417837,0.00009071381,0.00008720227,0.0008736034,0.0009455996,0.01401319],"genre_scores_gemma":[0.9616765,0.0002214822,0.03276286,0.0000771521,0.0000497912,0.00008472183,0.0006681417,0.00008901875,0.004370503],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005873323,"threshold_uncertainty_score":0.01964819,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02391676863159911,"score_gpt":0.2490021860560393,"score_spread":0.2250854174244402,"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."}}