{"id":"W2984492834","doi":"10.1016/j.tcs.2019.11.011","title":"Finitely distinguishable erasing pattern languages","year":2019,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; Ministry of Education - Singapore","keywords":"Decidability; Alphabet; Mathematical proof; Equivalence (formal languages); Mathematics; Regular language; Discrete mathematics; Decision problem; Object (grammar); Dimension (graph theory); Theoretical computer science; Combinatorics; Computer science; Artificial intelligence; Algorithm; Linguistics; Automaton","routes":{"ca_aff":true,"ca_fund":true,"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":[],"consensus_categories":[],"category_scores_codex":[0.00111333,0.0001673395,0.000186311,0.0001395665,0.0003022932,0.0007156869,0.00225769,0.00003656933,0.000158362],"category_scores_gemma":[0.000128072,0.0001334845,0.00005684122,0.000806238,0.0006208711,0.00044967,0.001036073,0.0002799907,0.0006484921],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003057325,"about_ca_system_score_gemma":0.00006835267,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000018927,"about_ca_topic_score_gemma":3.028308e-7,"domain_scores_codex":[0.9977925,0.00009605156,0.000195824,0.0007111772,0.0006165465,0.0005879476],"domain_scores_gemma":[0.9985165,0.0002909755,0.00006372092,0.0008213972,0.0001081932,0.0001992037],"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.000001282547,0.00003124323,0.002691764,0.00001061728,0.000002346359,0.00002139352,0.0004437431,0.0003257225,0.0002601056,0.7101457,0.00003971155,0.2860264],"study_design_scores_gemma":[0.0001868786,0.0001564561,0.005166565,0.00004806468,0.000001769051,0.00004422064,0.000008803341,0.9767786,0.00087411,0.01585709,0.0006176571,0.000259773],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0953579,0.00002306669,0.8851807,0.0007913825,0.000798047,0.00009545035,8.475684e-7,0.0003381669,0.01741447],"genre_scores_gemma":[0.8991203,7.363978e-7,0.09976875,0.0008004137,0.0001964082,0.000001717382,7.997792e-7,0.00000805833,0.0001027858],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9764529,"threshold_uncertainty_score":0.833527,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.005119954103830968,"score_gpt":0.2525612319938292,"score_spread":0.2474412778899982,"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."}}