{"id":"W2081745941","doi":"10.1016/j.tcs.2012.03.043","title":"Lower bounds for the size of deterministic unranked tree automata","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"Queen's University","funders":"","keywords":"Nondeterministic finite automaton; Nondeterministic algorithm; Automaton; Deterministic finite automaton; Deterministic automaton; Mathematics; Combinatorics; Upper and lower bounds; Tree (set theory); Discrete mathematics; Regular language; Computer science; Automata theory; Theoretical computer science","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.00515894,0.0018596,0.002698607,0.002739828,0.002216714,0.006498889,0.005616829,0.004018362,0.01468068],"category_scores_gemma":[0.05119228,0.001589564,0.00214784,0.00257097,0.004365803,0.01579433,0.004732637,0.006316073,0.002375174],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003817931,"about_ca_system_score_gemma":0.002769389,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009210786,"about_ca_topic_score_gemma":0.001944242,"domain_scores_codex":[0.9919308,0.002178411,0.0005173509,0.001468202,0.00261437,0.0012909],"domain_scores_gemma":[0.8418501,0.1350733,0.003811043,0.01062337,0.004633711,0.004008334],"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.002406619,0.0006644548,0.005156788,0.001626364,0.00026246,0.0004958005,0.001165048,0.18067,0.03354243,0.6813336,0.0235222,0.06915423],"study_design_scores_gemma":[0.0001289591,0.0001270084,0.0006965186,0.00009347656,0.00009107062,0.0001952867,0.0001048183,0.2696485,0.00718278,0.7186316,0.003026042,0.00007383055],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3660502,0.008539893,0.5315621,0.01708356,0.001179327,0.0003367476,0.005040068,0.005792185,0.06441579],"genre_scores_gemma":[0.8881777,0.002391325,0.08862635,0.00145715,0.001444239,0.0006850327,0.002669482,0.001439412,0.01310938],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01468068,"threshold_uncertainty_score":0.04911178,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01303013926355075,"score_gpt":0.2616167939493669,"score_spread":0.2485866546858161,"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."}}