{"id":"W4386143380","doi":"10.1016/j.ic.2023.105080","title":"On the complexity of decision problems for some classes of machines and applications","year":2023,"lang":"en","type":"article","venue":"Information and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Nondeterministic algorithm; Decision problem; Discrete mathematics; Regular language; Automaton; Mathematics; Bounded function; NP; Equivalence (formal languages); Theoretical computer science; Computer science; Time complexity; Turing machine; Algorithm","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.006824327,0.001436558,0.003315076,0.003228159,0.00275519,0.009942505,0.004008823,0.004190034,0.01624785],"category_scores_gemma":[0.05959462,0.001471578,0.00349007,0.004261341,0.005963186,0.02018762,0.004531574,0.009050392,0.0007677375],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005715861,"about_ca_system_score_gemma":0.002894753,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003676238,"about_ca_topic_score_gemma":0.002869139,"domain_scores_codex":[0.9922363,0.002827935,0.0005123887,0.001359605,0.002065165,0.0009986483],"domain_scores_gemma":[0.8373725,0.1498775,0.003726307,0.004106905,0.00251124,0.002405568],"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.0005095148,0.0003487616,0.002676113,0.0005231902,0.0001316885,0.000180271,0.000680043,0.07113148,0.0007357732,0.8905919,0.008645212,0.02384609],"study_design_scores_gemma":[0.00006019685,0.00002462556,0.0005032413,0.00003025199,0.00002749796,0.00009770688,0.0001116477,0.12764,0.0001766387,0.8701311,0.001176312,0.00002067034],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4526488,0.008726509,0.4234035,0.03337577,0.0005468273,0.0006280846,0.00431427,0.0007863527,0.0755698],"genre_scores_gemma":[0.9091204,0.003170223,0.07055058,0.001184477,0.001237106,0.0006349288,0.002394561,0.0002890677,0.01141865],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01624785,"threshold_uncertainty_score":0.05435443,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03678432344391271,"score_gpt":0.2845674218857239,"score_spread":0.2477830984418112,"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."}}