{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00143127,0.0007451363,0.0007933123,0.001355861,0.0001672725,0.0004902486,0.006003416,0.0003654943,0.00004413195],"category_scores_gemma":[0.00005559476,0.0006730809,0.0001757654,0.0009429938,0.0007999957,0.000991155,0.001632305,0.001060661,0.00009823703],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003150876,"about_ca_system_score_gemma":0.0005377933,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008653794,"about_ca_topic_score_gemma":0.0003490256,"domain_scores_codex":[0.9950064,0.00007723574,0.0008135741,0.002032417,0.001003931,0.001066386],"domain_scores_gemma":[0.9966142,0.000475454,0.0003389345,0.002271617,0.00006526562,0.0002345118],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000009339492,0.00006103949,0.00005766797,0.00003491891,0.000009367396,0.0003305863,0.001942076,0.001658055,0.0001254988,0.03839444,0.00003782984,0.9573392],"study_design_scores_gemma":[0.000700327,0.0002220052,0.001844923,0.00059467,0.000006698569,0.0001205306,2.219703e-7,0.373322,0.001381484,0.6183559,0.002318061,0.001133248],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0004453604,0.0004871863,0.985922,0.0006994212,0.001783071,0.0004391753,0.00001000762,0.000433474,0.009780264],"genre_scores_gemma":[0.6081273,0.0002921391,0.3841426,0.00511682,0.000602651,0.00003819089,0.00001768308,0.0001658969,0.001496725],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9562059,"threshold_uncertainty_score":0.999572,"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."}}