{"id":"W124609046","doi":"10.1007/978-3-642-22600-7_21","title":"State Trade-Offs in Unranked Tree Automata","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"ca_institutions":"Queen's University","funders":"","keywords":"Nondeterministic algorithm; Nondeterministic finite automaton; Deterministic finite automaton; Tree (set theory); Automaton; Upper and lower bounds; Computer science; Horizontal and vertical; State (computer science); ω-automaton; Finite-state machine; Quantum finite automata; Discrete mathematics; Mathematics; Combinatorics; Automata theory; Theoretical computer science; Algorithm; Geometry","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.002700148,0.000724242,0.00162742,0.001057931,0.001388312,0.004715003,0.001724489,0.002387517,0.008641996],"category_scores_gemma":[0.01575116,0.000902552,0.0007646657,0.001391313,0.002374883,0.008940878,0.001788901,0.002305833,0.0008550101],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001679045,"about_ca_system_score_gemma":0.000785154,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006378472,"about_ca_topic_score_gemma":0.001283662,"domain_scores_codex":[0.9978262,0.0008879229,0.0001788107,0.0002927718,0.0005003873,0.0003139507],"domain_scores_gemma":[0.9769786,0.01880364,0.001003995,0.00155276,0.0009860011,0.0006749221],"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.0005502828,0.0001807009,0.001018735,0.0002465022,0.00004668864,0.0003117191,0.0005105241,0.2311347,0.006133705,0.7057291,0.00222083,0.05191657],"study_design_scores_gemma":[0.00002387347,0.00006442224,0.000136764,0.0000156202,0.00001869206,0.00005303197,0.00005028782,0.3553101,0.001192418,0.6426626,0.0004528844,0.00001936327],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"other","genre_scores_codex":[0.5367902,0.002005588,0.4219571,0.001435451,0.0001850492,0.00009650214,0.0003569474,0.001328435,0.03584479],"genre_scores_gemma":[0.9646767,0.0003161068,0.02753228,0.0000728964,0.0000647726,0.00007101894,0.0001296887,0.0001914175,0.006945085],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.008641996,"threshold_uncertainty_score":0.02891034,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.018659769607563,"score_gpt":0.2290334766230418,"score_spread":0.2103737070154788,"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."}}