{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001593247,0.0001916075,0.000394347,0.0002299126,0.0004942309,0.0009493258,0.0009083036,0.00005878538,0.000007608391],"category_scores_gemma":[0.00001820525,0.000137714,0.00007146029,0.0002673088,0.0007680142,0.001417304,0.0005081228,0.0001605664,0.000002610309],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003093233,"about_ca_system_score_gemma":0.00004636631,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002365351,"about_ca_topic_score_gemma":0.00000554875,"domain_scores_codex":[0.9981036,0.0001840741,0.0004913705,0.0003485882,0.0005849476,0.0002874768],"domain_scores_gemma":[0.9987966,0.0002401808,0.0003265881,0.0002713935,0.0001163195,0.0002489006],"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.00005443269,0.0002794705,0.0136894,0.0003278198,0.0001308255,0.0004973299,0.0038438,0.00008162112,0.0002737837,0.8133156,0.02447785,0.1430281],"study_design_scores_gemma":[0.001921116,0.001658204,0.04622571,0.0006342327,0.00003102187,0.01222945,0.0008284632,0.8940174,0.0000246388,0.03797723,0.003946462,0.0005060409],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.746488,0.008745558,0.2366155,0.00452645,0.002326692,0.0001766912,0.00001066745,0.0001096979,0.001000772],"genre_scores_gemma":[0.9535418,0.0001254329,0.04574687,0.0003218333,0.0002094931,9.321118e-7,1.805677e-7,0.000004554314,0.00004893577],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8939358,"threshold_uncertainty_score":0.9154371,"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."}}