{"id":"W1501444314","doi":"10.1142/s0129054112400515","title":"QUOTIENT COMPLEXITY OF STAR-FREE LANGUAGES","year":2012,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quotient; Concatenation (mathematics); Mathematics; Regular language; Discrete mathematics; Star (game theory); Combinatorics; Pumping lemma for regular languages; Intersection (aeronautics); Computer science; Theoretical computer science; Automaton; 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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001340143,0.00008493943,0.0001788413,0.0005026383,0.00006762797,0.0001162949,0.004048596,0.00001874518,0.00003005022],"category_scores_gemma":[0.00016297,0.00007156475,0.0001080496,0.0004564608,0.0006393909,0.002277627,0.000713128,0.00009299091,0.000004716391],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007452713,"about_ca_system_score_gemma":0.0002372612,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002020696,"about_ca_topic_score_gemma":0.000001628729,"domain_scores_codex":[0.9979469,0.00004796459,0.0005700255,0.0001210202,0.001130569,0.0001835384],"domain_scores_gemma":[0.9972538,0.0001566105,0.0007250485,0.0004379587,0.001317289,0.000109341],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.00001890263,0.0006283688,0.0040846,0.0000134789,0.00009552374,0.000006648775,0.002777217,0.001000898,0.008384443,0.9170928,0.0007482899,0.06514882],"study_design_scores_gemma":[0.0032714,0.001113659,0.449171,0.0006362121,0.00005482356,0.001195215,0.0005532856,0.2515096,0.1146976,0.1715488,0.005459591,0.0007887722],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2976187,0.0001070576,0.6989694,0.0008985574,0.00194668,0.00003542665,0.000007121991,0.00001214922,0.0004048505],"genre_scores_gemma":[0.7436277,0.000007423891,0.2560851,0.00008560994,0.0001848257,3.398501e-7,7.582203e-7,0.000002170576,0.000006137033],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7455441,"threshold_uncertainty_score":0.7523366,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03215229918022616,"score_gpt":0.3184217059545243,"score_spread":0.2862694067742982,"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."}}