{"id":"W2079567772","doi":"10.1016/j.tcs.2014.11.015","title":"Descriptional complexity of unambiguous input-driven pushdown automata","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Academy of Finland","keywords":"Pushdown automaton; Deterministic pushdown automaton; Nondeterministic algorithm; Embedded pushdown automaton; Discrete mathematics; Homomorphism; Büchi automaton; Two-way deterministic finite automaton; Nested word; Nondeterministic finite automaton; Deterministic automaton; Mathematics; Deterministic context-free grammar; Combinatorics; Automaton; Computer science; Theoretical computer science; Automata theory; Quantum finite automata; Rule-based machine translation; Context-free grammar; Artificial intelligence","routes":{"ca_aff":true,"ca_fund":true,"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":["sts"],"consensus_categories":[],"category_scores_codex":[0.00222173,0.0002354367,0.0003589584,0.0002494227,0.0003686538,0.00030996,0.004293293,0.00006690416,0.00007331211],"category_scores_gemma":[0.0001563961,0.0001956737,0.0001114745,0.001130357,0.006976736,0.0007899789,0.00189884,0.0002051544,0.0001034553],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005888588,"about_ca_system_score_gemma":0.0001337853,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001084614,"about_ca_topic_score_gemma":7.824958e-7,"domain_scores_codex":[0.9968007,0.0002379035,0.0004557879,0.0008055366,0.001059534,0.0006405648],"domain_scores_gemma":[0.9975497,0.0002901207,0.0001549861,0.001428146,0.0002646989,0.0003123754],"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.000007306051,0.0001114535,0.00007462595,0.00001197293,0.000004521173,0.000003122451,0.0002015697,0.0001857467,0.002869128,0.9624186,0.00005102674,0.03406091],"study_design_scores_gemma":[0.0002087595,0.0002230662,0.003970025,0.00002798042,0.000003009252,0.00003761056,0.000002146296,0.5841883,0.002486696,0.4085529,0.000133954,0.0001656407],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08036755,0.00001010674,0.9130487,0.001079876,0.0006746016,0.0001210357,0.000004537454,0.0003677439,0.004325851],"genre_scores_gemma":[0.7535039,0.000001474991,0.2458098,0.0005684405,0.00009789076,0.000003589004,0.000002538573,0.000007447254,0.000004924559],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6731363,"threshold_uncertainty_score":0.9957257,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02080017538274525,"score_gpt":0.24438166321695,"score_spread":0.2235814878342047,"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."}}