{"id":"W1992943987","doi":"10.1145/1140123.1140237","title":"Finite automata models for CS problem with binary semaphore","year":2006,"lang":"en","type":"article","venue":"ACM SIGCSE Bulletin","topic":"Software Engineering Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Nipissing University","funders":"","keywords":"Semaphore; Computer science; Synchronization (alternating current); Automaton; Simplicity; Deterministic finite automaton; Finite-state machine; Visualization; Theoretical computer science; Binary number; ω-automaton; Quantum finite automata; Algorithm; Automata theory; Parallel computing; Programming language; Mathematics; Arithmetic; Artificial intelligence; Channel (broadcasting)","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":[],"consensus_categories":[],"category_scores_codex":[0.0003673122,0.0002017617,0.0001834093,0.0001486594,0.0001225676,0.0001663019,0.001656917,0.00008296719,0.00002390783],"category_scores_gemma":[0.0003145141,0.0001709284,0.00005857717,0.0003926411,0.00004677773,0.0001560598,0.0005536435,0.0001704245,0.00013356],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005202496,"about_ca_system_score_gemma":0.00008973352,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008449343,"about_ca_topic_score_gemma":0.000004063094,"domain_scores_codex":[0.9982791,0.0000306303,0.0002069515,0.0005204736,0.0004233497,0.0005394725],"domain_scores_gemma":[0.9969888,0.001443107,0.00005376829,0.001275381,0.0001434968,0.00009541246],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001324606,0.0004923693,0.002346762,0.0004264937,0.00007934114,0.0002774388,0.0005662703,0.4974265,0.0006703764,0.02687674,0.4583543,0.01235096],"study_design_scores_gemma":[0.002936685,0.0011344,0.003686725,0.0002780486,0.00002038284,0.00009580457,0.00001776567,0.736963,0.003090305,0.02614163,0.2244771,0.001158175],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02219666,0.0002162035,0.9660013,0.008566529,0.0001058069,0.0008370423,0.00001603813,0.001272532,0.0007878866],"genre_scores_gemma":[0.4518891,0.00000768473,0.5449889,0.0001706226,0.0001130663,0.0003098379,0.00002051916,0.00004926488,0.002450965],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4296924,"threshold_uncertainty_score":0.6970257,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01652126303611729,"score_gpt":0.232397117556737,"score_spread":0.2158758545206197,"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."}}