{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002093582,0.0003907148,0.001385985,0.001425272,0.00150586,0.006118566,0.001624726,0.001477377,0.007006612],"category_scores_gemma":[0.01932727,0.0007513343,0.001201305,0.001534593,0.002352279,0.01157395,0.002451425,0.002571983,0.0005510219],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002320563,"about_ca_system_score_gemma":0.001821427,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001999387,"about_ca_topic_score_gemma":0.001977363,"domain_scores_codex":[0.996819,0.0008222705,0.0002822173,0.0005473888,0.001051224,0.0004779244],"domain_scores_gemma":[0.9522783,0.03994735,0.00256,0.002104921,0.001790013,0.00131945],"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.001185525,0.0002365818,0.008261061,0.0002592593,0.00009944657,0.0005631427,0.002062264,0.09347164,0.009153043,0.8617621,0.002281152,0.02066472],"study_design_scores_gemma":[0.00004801303,0.00008200078,0.00172754,0.00001994585,0.00004849923,0.0001390378,0.0001817536,0.3178307,0.003353207,0.6757448,0.000775616,0.00004894185],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8995306,0.0003600593,0.08822673,0.001240983,0.00004118201,0.00004840816,0.0009868972,0.0003997797,0.009165324],"genre_scores_gemma":[0.9896493,0.0001326344,0.006970786,0.00004732443,0.00006762821,0.00005505254,0.0006714658,0.00007682663,0.002329095],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007006612,"threshold_uncertainty_score":0.02343947,"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."}}