{"id":"W2075877008","doi":"10.1142/s0129054110007386","title":"ON THE NON-DETERMINISTIC COMMUNICATION COMPLEXITY OF REGULAR LANGUAGES","year":2010,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"Communication complexity; Logarithm; Regular language; Time complexity; Constant (computer programming); Cover (algebra); Probabilistic logic; Mathematics; Computer science; Theoretical computer science; Computational complexity theory; Formal language; Range (aeronautics); Discrete mathematics; Algorithm; Automaton; Artificial intelligence; Programming language","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.004234462,0.001048708,0.001557081,0.001374218,0.002454717,0.005722954,0.003137124,0.001966092,0.008569176],"category_scores_gemma":[0.04080363,0.001015312,0.002127386,0.002035419,0.006207469,0.01922172,0.004227988,0.006929691,0.00104383],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004295687,"about_ca_system_score_gemma":0.002586312,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001879261,"about_ca_topic_score_gemma":0.001398164,"domain_scores_codex":[0.9900715,0.002878833,0.0005537816,0.001960101,0.002658185,0.001877526],"domain_scores_gemma":[0.8365181,0.1459614,0.005336857,0.007783653,0.002665725,0.001734209],"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.0007058871,0.0002465585,0.004085402,0.000708485,0.0001341051,0.0004741357,0.001634871,0.1810604,0.009361956,0.771859,0.00325936,0.02646977],"study_design_scores_gemma":[0.00005845015,0.00008676938,0.0008600075,0.00004119932,0.00005556207,0.0002362337,0.0001751922,0.323156,0.004721234,0.6682938,0.002249981,0.0000656421],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4505089,0.00254407,0.4957162,0.009769731,0.0001601942,0.0002067517,0.0009522079,0.001015961,0.039126],"genre_scores_gemma":[0.9560696,0.0009189929,0.03347219,0.0004871429,0.000327119,0.0003428861,0.0005624943,0.0003645061,0.007455199],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008569176,"threshold_uncertainty_score":0.03116757,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02129091006112265,"score_gpt":0.3140838002759662,"score_spread":0.2927928902148435,"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."}}