{"id":"W2091011159","doi":"10.1080/0020716031000148205","title":"Language equations for timed alternating finite automata","year":2003,"lang":"en","type":"article","venue":"International Journal of Computer Mathematics","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Computation; Computer science; Automaton; Finite-state machine; Timed automaton; Deterministic automaton; ω-automaton; Set (abstract data type); Quantum finite automata; Asynchronous communication; Theoretical computer science; Automata theory; Algorithm; Algebra over a field; Mathematics; Programming language; Pure mathematics","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.001321775,0.0001183932,0.000192007,0.0002533603,0.00005358785,0.0002486969,0.001469346,0.00004310396,0.00001363284],"category_scores_gemma":[0.001158541,0.0001059308,0.0001459845,0.0001350767,0.0000229925,0.000661932,0.0001040901,0.0001275665,0.00001815603],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007976967,"about_ca_system_score_gemma":0.00009490581,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.514665e-7,"about_ca_topic_score_gemma":2.360215e-7,"domain_scores_codex":[0.9983478,0.0000800269,0.0007099731,0.0001272797,0.0005832001,0.0001517229],"domain_scores_gemma":[0.9971951,0.0009302783,0.0007805293,0.0003005266,0.0007262444,0.00006735769],"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.000007265244,0.000285259,0.00002221368,0.00003779614,0.0001852879,0.00002499813,0.00404605,0.008274942,0.0007370162,0.9345735,0.0006777626,0.05112792],"study_design_scores_gemma":[0.0007060603,0.0001058991,0.00003684429,0.0001031924,0.00001289366,0.0002153226,0.00004473512,0.956172,0.00472786,0.03516522,0.002584558,0.0001253675],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003395343,0.00003776534,0.9929966,0.0003343566,0.002268714,0.000129821,0.000004929032,0.00004877618,0.0007836993],"genre_scores_gemma":[0.08446603,0.000006226343,0.9149326,0.0001907334,0.0003052462,0.000006224799,0.000002211835,0.00001185728,0.00007886937],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9478971,"threshold_uncertainty_score":0.4319734,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04358645793215987,"score_gpt":0.3512650919097619,"score_spread":0.307678633977602,"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."}}