{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008398228,0.0004153364,0.000622671,0.000648192,0.0006177551,0.002774073,0.001038677,0.0006029903,0.003359442],"category_scores_gemma":[0.007267049,0.0003241709,0.0007472652,0.0005978693,0.001625405,0.004621546,0.001337052,0.00122037,0.0003872082],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001364888,"about_ca_system_score_gemma":0.001125455,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001499144,"about_ca_topic_score_gemma":0.001534593,"domain_scores_codex":[0.9978799,0.0003511203,0.0002712823,0.0004667453,0.0006357841,0.0003951168],"domain_scores_gemma":[0.9893103,0.00704836,0.001099638,0.001129832,0.0009546317,0.0004572922],"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.001078613,0.0003330683,0.008759102,0.0004450061,0.00009235512,0.0006283976,0.001549872,0.3431402,0.06680913,0.5205684,0.001840594,0.05475536],"study_design_scores_gemma":[0.00003411271,0.000156684,0.001498888,0.00001918728,0.00003783672,0.0001323022,0.0001725461,0.6914617,0.02110143,0.2841376,0.00118519,0.00006252121],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.793494,0.0002138567,0.1994924,0.0003677872,0.00003821251,0.00005669747,0.0005830184,0.0006705089,0.005083417],"genre_scores_gemma":[0.9759665,0.00009319025,0.02172046,0.00003314278,0.00002189541,0.00007128211,0.0005731728,0.00006073624,0.001459525],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003359442,"threshold_uncertainty_score":0.01123846,"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."}}