{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007870161,0.00006526599,0.0001179654,0.00009718695,0.0001011175,0.0001136686,0.002183214,0.00003048155,0.000006256086],"category_scores_gemma":[0.0004481188,0.00003887921,0.00008041879,0.0003833283,0.00005116646,0.0002422669,0.00067329,0.000140333,0.000009385803],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006563412,"about_ca_system_score_gemma":0.00002371524,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001715845,"about_ca_topic_score_gemma":6.533137e-7,"domain_scores_codex":[0.9992619,0.00006722197,0.0001871493,0.00009137485,0.000249088,0.0001432542],"domain_scores_gemma":[0.9987378,0.0001430011,0.0001595682,0.000870467,0.00003320038,0.00005596504],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006900587,0.00024442,0.02526481,0.0001910626,0.0005597385,0.001245088,0.005887133,0.0004940793,0.1272077,0.09469464,0.4800383,0.2641041],"study_design_scores_gemma":[0.00264077,0.0005438337,0.3302496,0.001008684,0.00009608623,0.003503385,0.001289584,0.02223606,0.03358214,0.4320403,0.171977,0.0008326172],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9768587,0.0004569869,0.001340889,0.02024067,0.0006172688,0.00004590226,0.000001569751,0.0001324227,0.0003055863],"genre_scores_gemma":[0.986607,0.0003594995,0.0110753,0.001116506,0.0003966666,0.000001374064,3.861052e-7,0.00001473657,0.0004285065],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3373457,"threshold_uncertainty_score":0.4056992,"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."}}