{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008846616,0.0008765202,0.0006079394,0.0007574831,0.0009790933,0.002044112,0.001376883,0.001634015,0.006490615],"category_scores_gemma":[0.00370455,0.0003710696,0.00153806,0.0008699023,0.001352582,0.002652787,0.001178644,0.002257868,0.0009022248],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001816396,"about_ca_system_score_gemma":0.00214034,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005544504,"about_ca_topic_score_gemma":0.006609886,"domain_scores_codex":[0.9991455,0.000280464,0.00006125958,0.0002088276,0.0001905625,0.0001133921],"domain_scores_gemma":[0.9977973,0.001532409,0.0001899927,0.0001926068,0.0001866461,0.0001011633],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005846736,0.00006989796,0.0005475119,0.0001481225,0.0000264113,0.0002945771,0.0002540774,0.1687563,0.001556928,0.8142946,0.002628172,0.01136484],"study_design_scores_gemma":[0.0000182044,0.00003530009,0.0001283818,0.00004082525,0.00002439292,0.0001261119,0.0000917172,0.5071685,0.0006270992,0.4836019,0.008120314,0.00001735972],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02238272,0.0009624059,0.9564291,0.0009564033,0.0001611047,0.0001475894,0.0003689715,0.0003744638,0.01821728],"genre_scores_gemma":[0.5965093,0.001948104,0.3642678,0.0003859963,0.0003989516,0.0008170688,0.001009653,0.0002392068,0.03442395],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006490615,"threshold_uncertainty_score":0.02171326,"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."}}