{"id":"W2766804132","doi":"10.1007/978-3-319-94631-3_7","title":"A New Technique for Reachability of States in Concatenation Automata","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Concatenation (mathematics); Reachability; Computer science; Automaton; Mathematical proof; Theoretical computer science; State (computer science); Finite-state machine; Algorithm; Discrete mathematics; Mathematics; Combinatorics","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.001714887,0.001644748,0.001279156,0.002647631,0.002704666,0.002811042,0.003208897,0.001841549,0.01062375],"category_scores_gemma":[0.004527146,0.001340476,0.00396359,0.002695458,0.003781074,0.01012165,0.00709744,0.00637358,0.003972036],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001080482,"about_ca_system_score_gemma":0.001022949,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008761407,"about_ca_topic_score_gemma":0.001043592,"domain_scores_codex":[0.9973557,0.0004614554,0.0003114364,0.000813145,0.000876158,0.0001821521],"domain_scores_gemma":[0.9968767,0.001799737,0.0001221666,0.0007594958,0.0003269044,0.0001149414],"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.0001721864,0.00007241066,0.000216208,0.0005679934,0.0000703219,0.0004897072,0.00117657,0.006006617,0.02546526,0.8190615,0.004824029,0.1418771],"study_design_scores_gemma":[0.00004251654,0.0001795484,0.0002859729,0.0001826497,0.0002547698,0.001250599,0.0001987039,0.08048906,0.03394883,0.8112565,0.07177936,0.0001314705],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001506463,0.0002277491,0.9916155,0.00008258852,0.0001980298,0.00005075458,0.00007649598,0.0009386388,0.005303853],"genre_scores_gemma":[0.0910878,0.0009371677,0.8886684,0.0003659304,0.0004969216,0.0005212504,0.0004846111,0.001534854,0.01590309],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01062375,"threshold_uncertainty_score":0.03553998,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01500712873723197,"score_gpt":0.2591802567197418,"score_spread":0.2441731279825098,"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."}}