{"id":"W131394547","doi":"","title":"Some succinctness properties of Ω-DTAFA","year":2006,"lang":"en","type":"article","venue":"International Conference on Software Engineering","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Timed automaton; Succinctness; Automaton; Computer science; Finite-state machine; Theoretical computer science; ω-automaton; Deterministic automaton; Deterministic finite automaton; Expressive power; Two-way deterministic finite automaton; Nondeterministic finite automaton; DFA minimization; Determinism; Büchi automaton; Quantum finite automata; Automata theory; Algorithm","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.002854552,0.0006268047,0.0007365268,0.001049024,0.0009880691,0.002433948,0.001505173,0.00115683,0.004478331],"category_scores_gemma":[0.01812683,0.0007614307,0.001538101,0.001401823,0.001949354,0.007097195,0.002185267,0.002351098,0.001028198],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001042054,"about_ca_system_score_gemma":0.001261735,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001392895,"about_ca_topic_score_gemma":0.001587202,"domain_scores_codex":[0.9963601,0.0007373915,0.000697208,0.0008705914,0.001091118,0.0002435663],"domain_scores_gemma":[0.9798003,0.009989959,0.001251548,0.00581556,0.002797481,0.0003452345],"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.000367684,0.0001238416,0.002996158,0.0003585123,0.0000663972,0.0005517732,0.001111543,0.03246558,0.01776996,0.8595307,0.002618392,0.08203945],"study_design_scores_gemma":[0.00006472026,0.0001130308,0.0004640515,0.0001023378,0.0000685393,0.0008252189,0.0001316751,0.1826652,0.01474105,0.7815136,0.01925046,0.00006022147],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06444373,0.0005512012,0.9202427,0.0008244062,0.0001669393,0.0001935424,0.001356188,0.001532514,0.01068863],"genre_scores_gemma":[0.660889,0.0006586555,0.324228,0.0007977785,0.0001805014,0.0008140674,0.003095154,0.0004424915,0.008894369],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004478331,"threshold_uncertainty_score":0.01509649,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03811146635833607,"score_gpt":0.2589624798440075,"score_spread":0.2208510134856714,"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."}}