{"id":"W3098573930","doi":"10.46298/lmcs-19(2:5)2023","title":"Inferring Symbolic Automata","year":2023,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Regina","funders":"Israel Science Foundation; Alberta Machine Intelligence Institute; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; Canadian Institute for Advanced Research","keywords":"Learnability; Computer science; Theoretical computer science; Model checking; Identifiability; Regular language; Kleene algebra; Bounded function; Boolean function; Limit (mathematics); Probably approximately correct learning; Polynomial; Discrete mathematics; Automaton; Mathematics; Algorithm; Artificial intelligence; Computational learning theory; Machine learning","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.005994642,0.000172231,0.0002590967,0.0005921629,0.0002759642,0.0004693409,0.003188668,0.00006448481,0.000008564993],"category_scores_gemma":[0.0005458482,0.0001369724,0.0000605373,0.005714627,0.0002856959,0.0005942404,0.002579391,0.0004036206,0.0001635285],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005124511,"about_ca_system_score_gemma":0.00009242882,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002356449,"about_ca_topic_score_gemma":6.914377e-7,"domain_scores_codex":[0.9970028,0.0004567319,0.0003237074,0.0009238541,0.0005494963,0.0007434372],"domain_scores_gemma":[0.9980335,0.0007802296,0.00007059697,0.000861027,0.00005540892,0.0001992333],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[5.026754e-7,0.00002982626,0.001291902,0.000006182439,0.00000116827,0.00005798044,0.0003578755,0.009154502,0.0006836388,0.03987471,0.00004047338,0.9485012],"study_design_scores_gemma":[0.0001445672,0.00006722099,0.06011418,0.00002305036,5.031208e-7,0.00002663293,0.000002382936,0.9072665,0.0004255748,0.03092505,0.000822338,0.0001820232],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01314954,0.00001736425,0.9815456,0.001110508,0.001488892,0.00009513173,2.162988e-7,0.001130378,0.001462399],"genre_scores_gemma":[0.08369084,0.000008060159,0.9155632,0.0005283753,0.0001388746,0.00001215957,3.044917e-7,0.000005563867,0.00005265732],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9483192,"threshold_uncertainty_score":0.5925391,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06941551654696516,"score_gpt":0.4283480724184977,"score_spread":0.3589325558715326,"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."}}