{"id":"W3116363031","doi":"10.1016/j.tcs.2020.12.028","title":"Decision problems and projection languages for restricted variants of two-dimensional automata","year":2020,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Nondeterministic finite automaton; Deterministic automaton; Decidability; Mathematics; Nondeterministic algorithm; Discrete mathematics; Deterministic finite automaton; Büchi automaton; Decision problem; Regular language; Combinatorics; Two-way deterministic finite automaton; Quantum finite automata; Unary operation; Equivalence (formal languages); Deterministic pushdown automaton; Automata theory; Automaton; Finite-state machine; Computer science; Algorithm; Theoretical computer science","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":[],"consensus_categories":[],"category_scores_codex":[0.0007843555,0.0001299207,0.0001954472,0.0001152509,0.0001954228,0.0001715139,0.001032472,0.00003825768,0.000006526184],"category_scores_gemma":[0.0002336805,0.000099468,0.00003877934,0.0008863742,0.0008304547,0.000499107,0.0008087315,0.00008825136,0.000004647315],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001436689,"about_ca_system_score_gemma":0.00008272311,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004380968,"about_ca_topic_score_gemma":2.393876e-7,"domain_scores_codex":[0.9983107,0.00006098889,0.0002678792,0.0006039384,0.0004623755,0.0002940451],"domain_scores_gemma":[0.9986925,0.0004978701,0.00009165391,0.0003717314,0.0001589441,0.0001873699],"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.00002645882,0.00004587332,0.0000292423,0.00002493904,0.000003791286,0.000003399679,0.0005102999,0.00035967,0.01238168,0.9068117,0.0000552237,0.07974777],"study_design_scores_gemma":[0.0005470156,0.0004098561,0.001566545,0.00004877003,0.000004467049,0.00002627039,0.000004657898,0.8713595,0.004066094,0.1218294,0.00001743833,0.0001199255],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1773304,0.00003300335,0.8210356,0.000839084,0.0001665128,0.0002838268,0.000004827542,0.0001740533,0.0001326201],"genre_scores_gemma":[0.6985068,0.000001482228,0.3011042,0.0003193589,0.00005541317,0.000006174142,9.471077e-7,0.000004623897,0.000001003816],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8709999,"threshold_uncertainty_score":0.4056188,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0171740685094389,"score_gpt":0.2714211806875483,"score_spread":0.2542471121781094,"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."}}