{"id":"W2885772766","doi":"10.1007/978-3-319-98654-8_33","title":"Computational Complexity of Decision Problems on Self-verifying Finite Automata","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Nondeterministic algorithm; Decision problem; Nondeterministic finite automaton; Büchi automaton; Deterministic automaton; Computer science; Two-way deterministic finite automaton; Automaton; Computational complexity theory; Universality (dynamical systems); DFA minimization; Theoretical computer science; Deterministic finite automaton; NP; Equivalence (formal languages); Discrete mathematics; Algorithm; Automata theory; Mathematics; Computation; Turing machine","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.003731944,0.001069478,0.002128499,0.001387788,0.00171588,0.009105441,0.003464018,0.002633812,0.01305654],"category_scores_gemma":[0.03048862,0.001227264,0.003214255,0.002154641,0.004435755,0.01427945,0.004100482,0.005677276,0.0007818256],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004229183,"about_ca_system_score_gemma":0.002975672,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002120501,"about_ca_topic_score_gemma":0.001914638,"domain_scores_codex":[0.9932133,0.002342404,0.0004616833,0.001250332,0.00193704,0.0007953154],"domain_scores_gemma":[0.9465362,0.04759946,0.001469516,0.002266722,0.001250853,0.0008772576],"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.000453317,0.0002306858,0.001573322,0.0003896338,0.000122639,0.0001684148,0.000521757,0.07647656,0.001036557,0.8874617,0.004956027,0.0266093],"study_design_scores_gemma":[0.00005015045,0.00001533586,0.0001774691,0.00001799112,0.00001952255,0.00004066288,0.00006692217,0.08528742,0.0003043501,0.9133719,0.0006359653,0.00001233376],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.4481182,0.00232818,0.4760476,0.01167037,0.000396562,0.00045934,0.002610703,0.0007336698,0.0576355],"genre_scores_gemma":[0.9224716,0.0009812987,0.06218932,0.0004300069,0.0005914527,0.0003352148,0.001931767,0.0002088061,0.01086059],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01305654,"threshold_uncertainty_score":0.04367852,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03306512048453267,"score_gpt":0.2634941851035805,"score_spread":0.2304290646190478,"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."}}