{"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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.003072004,0.0002036466,0.0002611419,0.00008136944,0.0004877332,0.000291625,0.003988701,0.00005413019,0.00003599824],"category_scores_gemma":[0.0004015023,0.0001264538,0.0001407667,0.0007860729,0.003613936,0.0007454467,0.001046231,0.0001234368,0.00002817625],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003535463,"about_ca_system_score_gemma":0.0001139594,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001963924,"about_ca_topic_score_gemma":2.706909e-7,"domain_scores_codex":[0.9976399,0.00009097908,0.0003643415,0.0004558834,0.0006339855,0.0008149029],"domain_scores_gemma":[0.9947569,0.003306249,0.0001253258,0.001419678,0.0001502614,0.0002415256],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001462426,0.0001052647,0.00003153279,0.00001163128,0.000006794113,0.000001125983,0.000435096,0.00001281504,0.000897809,0.9310525,0.0000978453,0.06733297],"study_design_scores_gemma":[0.0004688646,0.0003705687,0.004936528,0.00003499812,0.00002385988,0.00005285732,0.00001398209,0.8153443,0.005059329,0.1725501,0.0008630631,0.0002815399],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03175521,0.00009147677,0.9636387,0.0008713945,0.001758509,0.0002945278,0.000004849667,0.0001871513,0.001398215],"genre_scores_gemma":[0.8989343,0.000003203781,0.100143,0.0006427933,0.0002275924,0.00002066695,2.928992e-7,0.0000101272,0.00001801004],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8671791,"threshold_uncertainty_score":0.9990976,"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."}}