{"id":"W2089939112","doi":"10.1016/j.tcs.2008.03.011","title":"Embedding finite automata within regular expressions","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Regular expression; Computer science; Automaton; Nondeterministic finite automaton; Timed automaton; Theoretical computer science; Büchi automaton; Set (abstract data type); Deterministic automaton; Algorithm; Expression (computer science); Representation (politics); Automata theory; Programming language","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.00183289,0.0007682088,0.0006954889,0.0009410335,0.0005856318,0.002820379,0.00135572,0.001068017,0.004489898],"category_scores_gemma":[0.008786207,0.001113654,0.001222326,0.000885943,0.002665891,0.008224335,0.002766337,0.002873044,0.001632525],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000906523,"about_ca_system_score_gemma":0.0007991114,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007702414,"about_ca_topic_score_gemma":0.000701034,"domain_scores_codex":[0.9974887,0.0009582088,0.000204258,0.0005608476,0.0005905648,0.0001974195],"domain_scores_gemma":[0.9930982,0.00461404,0.0003181783,0.001374001,0.0004851353,0.0001104134],"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.0001134135,0.00006260641,0.0003425603,0.0001841191,0.00002509644,0.0001726071,0.000979295,0.0240445,0.004876669,0.9186169,0.0006722875,0.04990992],"study_design_scores_gemma":[0.00002676209,0.00004015141,0.00007534287,0.0000603203,0.00003805693,0.00007669593,0.0001520552,0.06963035,0.008706525,0.9101557,0.01101535,0.00002278896],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0185819,0.0002192749,0.9734677,0.0003035938,0.00007417455,0.00004314211,0.00007917541,0.001336184,0.00589484],"genre_scores_gemma":[0.6040946,0.0007190855,0.3842299,0.0002065291,0.00009978354,0.0001831838,0.0004386429,0.0009179372,0.009110279],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004489898,"threshold_uncertainty_score":0.01502019,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02910968425773653,"score_gpt":0.3043006566341777,"score_spread":0.2751909723764412,"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."}}