{"id":"W4383554657","doi":"10.1145/3607471","title":"Co-lexicographically Ordering Automata and Regular Languages - Part I","year":2023,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"semigroups and automata theory","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"ca_institutions":"Dalhousie University","funders":"European Commission","keywords":"Lexicographical order; Regular language; Mathematics; Automaton; Discrete mathematics; Constant (computer programming); Nondeterministic finite automaton; ω-automaton; Combinatorics; Prefix; Deterministic automaton; Regular expression; Order (exchange); State (computer science); Nested word; Closure (psychology); Finite-state machine; Quantum finite automata; Automata theory; Computer science; Algorithm; Theoretical computer science","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.001334034,0.0007858175,0.000841347,0.001636293,0.001227481,0.004751015,0.001220877,0.001797143,0.003745832],"category_scores_gemma":[0.008667706,0.0008525586,0.002148654,0.002189737,0.006355742,0.008895815,0.002102013,0.003949407,0.0007184935],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00255858,"about_ca_system_score_gemma":0.001237032,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002541652,"about_ca_topic_score_gemma":0.001650016,"domain_scores_codex":[0.9961756,0.0007977163,0.0004487399,0.001335368,0.0009008098,0.0003416119],"domain_scores_gemma":[0.9863783,0.008546866,0.001646356,0.002232762,0.0008793522,0.0003164819],"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.00007266073,0.00004898855,0.001407929,0.0001897131,0.00003038987,0.0001475886,0.0005600457,0.01527937,0.003887141,0.9570241,0.0009502313,0.02040189],"study_design_scores_gemma":[0.00001305326,0.00006993027,0.0006925706,0.00006163913,0.00002165137,0.000283843,0.0001675354,0.0546083,0.004141942,0.9329744,0.006923662,0.00004148791],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09252924,0.003407269,0.8811572,0.002453196,0.0001562293,0.0001410916,0.0006524248,0.0008894586,0.01861391],"genre_scores_gemma":[0.7747181,0.002268659,0.2120752,0.0007413092,0.0005142255,0.0004278529,0.0009619657,0.0002350908,0.008057687],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004751015,"threshold_uncertainty_score":0.01856387,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01514252403544746,"score_gpt":0.2705909053530363,"score_spread":0.2554483813175888,"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."}}