{"id":"W2461701302","doi":"","title":"Descriptional complexity of formal systems : 17th International Workshop, DCFS 2015 Waterloo, ON, Canada, June 25-27, 2015 : proceedings","year":2015,"lang":"en","type":"book","venue":"Springer eBooks","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"","keywords":"Nondeterministic finite automaton; Regular language; Deterministic finite automaton; Deterministic automaton; Mathematics; Discrete mathematics; Nondeterministic algorithm; Succinctness; Pumping lemma for regular languages; Decidability; Quantum finite automata; Formal language; Finite-state machine; Computer science; Automata theory; Automaton; Theoretical computer science; Algorithm; Programming language","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003404016,0.0009445863,0.001369002,0.001686721,0.001300461,0.007142526,0.001914926,0.001096033,0.01635815],"category_scores_gemma":[0.006509097,0.001317132,0.001718408,0.002367078,0.002994565,0.006258768,0.002995312,0.004762074,0.002117986],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.01227592,"about_ca_system_score_gemma":0.007954078,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.04000852,"about_ca_topic_score_gemma":0.04922455,"domain_scores_codex":[0.997548,0.000423994,0.0001842543,0.0003411126,0.001333718,0.000168854],"domain_scores_gemma":[0.9955952,0.002357194,0.0001121933,0.00063958,0.001070141,0.0002256831],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00009597869,0.0001095978,0.0008267736,0.0009563583,0.00008594371,0.0001001682,0.0008535822,0.01219922,0.002112615,0.5136699,0.1940283,0.2749614],"study_design_scores_gemma":[0.00004720418,0.00002920764,0.001517121,0.0006019044,0.00005400885,0.0002287763,0.0004067482,0.03795051,0.002286363,0.6221293,0.3346809,0.00006801351],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.0236573,0.1203143,0.7169267,0.04255623,0.004346264,0.0002373601,0.004212773,0.002531335,0.0852178],"genre_scores_gemma":[0.2951062,0.1033899,0.4231762,0.00326397,0.005097406,0.0007347887,0.01524163,0.002568696,0.1514213],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.04000852,"threshold_uncertainty_score":0.08906847,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03406205820868684,"score_gpt":0.2609885873500331,"score_spread":0.2269265291413463,"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."}}