{"id":"W2097880459","doi":"10.1142/s0129054112400035","title":"STATE-SIZE HIERARCHY FOR FINITE-STATE COMPLEXITY","year":2012,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"","keywords":"Hierarchy; Finite-state machine; State (computer science); Turing machine; Encoding (memory); Mathematics; Time hierarchy theorem; Computable function; Deterministic finite automaton; Computational complexity theory; Finite state; Theoretical computer science; Discrete mathematics; Computer science; Algorithm; Universal Turing machine; Computation; Artificial intelligence","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.001979737,0.0001175847,0.000199346,0.0004666691,0.0001643198,0.0003609465,0.003295997,0.00001809997,0.0000197239],"category_scores_gemma":[0.0003939997,0.0001024716,0.000148423,0.0005011373,0.0005107099,0.003436427,0.0004304009,0.0001164495,0.000009217802],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001122713,"about_ca_system_score_gemma":0.0003770408,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008027862,"about_ca_topic_score_gemma":0.000001311485,"domain_scores_codex":[0.9978562,0.00004983941,0.0006478596,0.0001819128,0.0009567586,0.0003074587],"domain_scores_gemma":[0.9960831,0.0009508441,0.000674171,0.0003182472,0.001799375,0.0001742556],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001086314,0.001012531,0.003064568,0.00002833746,0.0002262842,0.00001869108,0.005840024,0.01138972,0.005905166,0.5097201,0.001568397,0.4611175],"study_design_scores_gemma":[0.002322008,0.0006644481,0.04732715,0.0002057217,0.00002146613,0.0005794817,0.00004803929,0.5352207,0.02135284,0.3730383,0.01865559,0.0005642602],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09359268,0.00005277895,0.9013687,0.001257147,0.00346765,0.0000902144,0.00001659805,0.00002281482,0.0001313727],"genre_scores_gemma":[0.6479993,0.00001030445,0.3514872,0.0002479374,0.0002229089,0.000001923475,0.000001190736,0.000003750879,0.00002547869],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5544066,"threshold_uncertainty_score":0.6124837,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03892250258857448,"score_gpt":0.3235433376829667,"score_spread":0.2846208350943922,"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."}}