{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003265222,0.0007714343,0.001760457,0.001654288,0.002049888,0.009366083,0.003403824,0.002572257,0.006750045],"category_scores_gemma":[0.02001486,0.001226137,0.002494052,0.002409038,0.004082127,0.01623311,0.005013554,0.005480579,0.0004754139],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004229217,"about_ca_system_score_gemma":0.002707305,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002644138,"about_ca_topic_score_gemma":0.002115666,"domain_scores_codex":[0.9930507,0.001856713,0.0006065419,0.001085423,0.002369031,0.001031599],"domain_scores_gemma":[0.9630404,0.02982079,0.001635279,0.002311619,0.002138521,0.001053437],"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.0002470471,0.0001369684,0.001819678,0.0002254107,0.00006863496,0.0004025815,0.001043239,0.04103806,0.002187903,0.9414989,0.00129221,0.01003949],"study_design_scores_gemma":[0.00002831254,0.00001558928,0.0002324037,0.00001434562,0.00002611736,0.00009100801,0.0001340941,0.06853805,0.001107001,0.9293107,0.0004775075,0.00002483692],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5827055,0.001101941,0.3836722,0.005767048,0.0001200248,0.0001474259,0.001857509,0.0007213476,0.02390688],"genre_scores_gemma":[0.9812201,0.0003507271,0.01410985,0.0002067249,0.00007766353,0.000108066,0.0006178068,0.0001153909,0.003193693],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009366083,"threshold_uncertainty_score":0.03068525,"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."}}