{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002727306,0.0003619732,0.0005885985,0.0007709533,0.00007099839,0.0001531656,0.002936478,0.0002954088,0.00002422295],"category_scores_gemma":[0.0002201873,0.0003162289,0.0001215682,0.0005403079,0.0005579249,0.0005115251,0.000835675,0.0003228309,0.000006787316],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002574235,"about_ca_system_score_gemma":0.0006806147,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001203373,"about_ca_topic_score_gemma":0.0001413336,"domain_scores_codex":[0.9969022,0.00004819991,0.0007781601,0.001227604,0.0005964744,0.0004473807],"domain_scores_gemma":[0.9969355,0.0008099015,0.000389,0.001466816,0.0002983423,0.0001003859],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003031677,0.00008140757,0.00008744177,0.0002083941,0.00001251969,0.00001512613,0.002662424,0.002781562,0.005361941,0.0725728,0.0001644116,0.9160216],"study_design_scores_gemma":[0.000295106,0.0002537373,0.0001206944,0.000348609,0.000002792686,0.00001411258,2.436442e-7,0.3630483,0.01938444,0.6157249,0.0005034215,0.0003037212],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000214003,0.0001053009,0.9971548,0.0004964336,0.0005727145,0.0009647073,0.00001557393,0.0001175389,0.0003589219],"genre_scores_gemma":[0.06872366,0.00001600863,0.9303603,0.0003826603,0.0002053379,0.00003696421,0.00001434317,0.0000275532,0.0002331927],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.915718,"threshold_uncertainty_score":0.999929,"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."}}