{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001324521,0.0007414133,0.0006690909,0.0009637548,0.0008271754,0.002180386,0.001162987,0.001295527,0.007150137],"category_scores_gemma":[0.007641653,0.000545338,0.001838615,0.001114542,0.001435647,0.003778801,0.001578523,0.002973077,0.001519649],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001934765,"about_ca_system_score_gemma":0.001596746,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005460134,"about_ca_topic_score_gemma":0.004521857,"domain_scores_codex":[0.9981969,0.0003320722,0.0002406275,0.0003111879,0.0007128741,0.0002064116],"domain_scores_gemma":[0.9971814,0.001436223,0.0003381939,0.0001368642,0.0008261646,0.00008114653],"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.0000112978,0.00001397552,0.0001984623,0.00005472509,0.00001127779,0.0002179008,0.0004661931,0.009387586,0.0009588572,0.9820062,0.001532804,0.005140888],"study_design_scores_gemma":[0.00003304552,0.00001278343,0.00008076363,0.00002561069,0.00001702145,0.0001755621,0.0001187583,0.09075284,0.0008443623,0.8917683,0.01615002,0.00002096031],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01900487,0.0006577422,0.9508129,0.001310425,0.0002696839,0.0001937425,0.0008951024,0.0004028608,0.02645265],"genre_scores_gemma":[0.5146487,0.001740326,0.4413084,0.001036057,0.0003947067,0.001325821,0.002680138,0.0003925821,0.03647323],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007150137,"threshold_uncertainty_score":0.02391964,"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."}}