{"id":"W2061212999","doi":"10.4204/eptcs.31.17","title":"Operational State Complexity of Deterministic Unranked Tree Automata","year":2010,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"","keywords":"Concatenation (mathematics); Tree (set theory); Tree automaton; Intersection (aeronautics); String (physics); State (computer science); Upper and lower bounds; Regular language; Time complexity","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.002640312,0.0002448716,0.0003282412,0.0003436772,0.0002495948,0.0003889094,0.00373938,0.00007209348,0.00003610603],"category_scores_gemma":[0.0002317879,0.0002124445,0.00006752757,0.001545376,0.00434154,0.001078778,0.0009827763,0.0006229508,0.00001552388],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001023659,"about_ca_system_score_gemma":0.0005158085,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000059833,"about_ca_topic_score_gemma":0.000009909456,"domain_scores_codex":[0.9967659,0.00002944767,0.000525453,0.0008613959,0.0008184655,0.0009993209],"domain_scores_gemma":[0.9986825,0.0001911169,0.0001527646,0.0005077517,0.0002742611,0.0001916269],"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.0000125984,0.0001161283,0.0001791222,0.00001338913,0.000003245696,0.000003419584,0.0003961217,0.000009614419,0.02033026,0.9580761,0.00001237178,0.02084763],"study_design_scores_gemma":[0.0003075807,0.0002107871,0.00333735,0.00001986901,0.00000181936,0.00006431004,0.00000345079,0.4972716,0.01706943,0.4815019,0.00003656252,0.0001753368],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6318951,0.00001446185,0.3635466,0.000840737,0.0004088162,0.0002469973,0.000002607625,0.0002242972,0.002820351],"genre_scores_gemma":[0.929216,0.000003832606,0.07042558,0.0002589044,0.00006409037,0.00001435382,9.010994e-7,0.00001033122,0.000006064464],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.497262,"threshold_uncertainty_score":0.9983681,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.00859781140142239,"score_gpt":0.2449642404551377,"score_spread":0.2363664290537153,"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."}}