{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002338974,0.0008311416,0.001148485,0.001564244,0.002064101,0.005082207,0.00276868,0.002736108,0.01516702],"category_scores_gemma":[0.01408372,0.001164345,0.001621605,0.001466824,0.003873378,0.01275456,0.006962556,0.007782127,0.003051961],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001104484,"about_ca_system_score_gemma":0.001150079,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002465086,"about_ca_topic_score_gemma":0.0003270915,"domain_scores_codex":[0.9953126,0.00101609,0.0004445303,0.001206666,0.001160963,0.0008591007],"domain_scores_gemma":[0.9812165,0.01151144,0.001107833,0.0037631,0.001378749,0.001022443],"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.0001622849,0.00005536529,0.0004356807,0.00008005118,0.00001520869,0.0002326085,0.00044917,0.0009905816,0.002851099,0.9793143,0.001443209,0.01397061],"study_design_scores_gemma":[0.00002627525,0.00003018013,0.0001278837,0.00002106135,0.00001423779,0.0003438694,0.00009377564,0.005518579,0.002839404,0.9878421,0.003120535,0.00002217097],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.27045,0.0006955303,0.6424375,0.0038356,0.0005821052,0.000116146,0.001188713,0.002942827,0.07775154],"genre_scores_gemma":[0.8767048,0.0003238205,0.08565909,0.00122911,0.0002991998,0.0001684827,0.001422122,0.0008475247,0.03334595],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01516702,"threshold_uncertainty_score":0.05073875,"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."}}