{"id":"W2063737596","doi":"10.1016/j.tcs.2011.12.048","title":"State complexity of the concatenation of regular tree languages","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"ca_institutions":"Queen's University","funders":"","keywords":"Concatenation (mathematics); Regular language; Pumping lemma for regular languages; String (physics); Tree (set theory); Mathematics; Automaton; Combinatorics; State (computer science); Discrete mathematics; Formal language; Time complexity; Finite-state machine; Upper and lower bounds; Computer science; Algorithm; 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.001228696,0.0001032067,0.0001806176,0.00008614764,0.0001202105,0.00003659486,0.002859826,0.00002487543,0.00002963596],"category_scores_gemma":[0.00005942092,0.00006375085,0.00007261916,0.0007832025,0.006248531,0.0003229742,0.0009844441,0.00008600278,0.000005469775],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001678177,"about_ca_system_score_gemma":0.00006386839,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002267528,"about_ca_topic_score_gemma":0.000001812545,"domain_scores_codex":[0.9984975,0.0001404264,0.0002831703,0.0003081154,0.0005190862,0.0002517396],"domain_scores_gemma":[0.9985847,0.0001028547,0.0001432711,0.0009026813,0.0001925463,0.00007392839],"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.000004767891,0.00005077717,0.0001268803,0.000008479967,0.000003335706,0.000001244411,0.001504141,0.00001091166,0.005134425,0.9719865,0.000008579405,0.02116],"study_design_scores_gemma":[0.0001454599,0.0001080805,0.03120925,0.00003218106,0.000003739257,0.00001001798,0.00002209727,0.13756,0.2597256,0.5710849,0.000004647856,0.0000940493],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3355234,0.00002118479,0.6600895,0.00019177,0.0002073238,0.0001039337,0.000002925477,0.00005697462,0.003802967],"genre_scores_gemma":[0.9266494,0.000001411124,0.0732014,0.0001222531,0.00001327011,0.000001305177,1.906534e-7,0.000003438728,0.000007335212],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.591126,"threshold_uncertainty_score":0.9964559,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02546993447421071,"score_gpt":0.2426792175923324,"score_spread":0.2172092831181217,"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."}}