{"id":"W2057559629","doi":"10.1006/jcss.2002.1855","title":"Unary Context-Free Grammars and Pushdown Automata, Descriptional Complexity and Auxiliary Space Lower Bounds","year":2002,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"semigroups and automata theory","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Deterministic context-free grammar; Embedded pushdown automaton; Deterministic pushdown automaton; Unary operation; Pushdown automaton; Mathematics; Discrete mathematics; Deterministic finite automaton; Nested word; Context-free language; Context-free grammar; Combinatorics; Quantum finite automata; Nondeterministic finite automaton; Automata theory; Finite-state machine; Computer science; Automaton; Rule-based machine translation; Algorithm; Tree-adjoining grammar; Theoretical computer science; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007934341,0.001778916,0.00336409,0.003515052,0.003519444,0.01246558,0.006958166,0.004235059,0.0121379],"category_scores_gemma":[0.04581119,0.002601174,0.004526863,0.005916376,0.009797204,0.04334599,0.009693744,0.01733649,0.001318957],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006615324,"about_ca_system_score_gemma":0.002968625,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002394345,"about_ca_topic_score_gemma":0.002388054,"domain_scores_codex":[0.9893154,0.003687804,0.0006844638,0.002008873,0.002666843,0.001636505],"domain_scores_gemma":[0.8525334,0.1289188,0.003203516,0.01043204,0.002555159,0.002357142],"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.0002622098,0.0001830982,0.001170341,0.0002087735,0.00006136052,0.0001317212,0.0009320583,0.02197797,0.001205892,0.9566696,0.002650853,0.01454615],"study_design_scores_gemma":[0.00001502097,0.00001659681,0.000170664,0.00001827663,0.00002985076,0.00005020671,0.00007688673,0.04241803,0.0005912254,0.9559954,0.0005927687,0.00002503052],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2409594,0.005620955,0.697873,0.01470287,0.0003083432,0.0001546104,0.001470811,0.001069409,0.03784065],"genre_scores_gemma":[0.9055136,0.002702506,0.07486797,0.001044102,0.0008073059,0.000514364,0.0015238,0.0007700774,0.01225625],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01246558,"threshold_uncertainty_score":0.04799777,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03199716091984622,"score_gpt":0.2199145394858522,"score_spread":0.1879173785660059,"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."}}