{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004816394,0.0008692585,0.001533083,0.0009985084,0.001777166,0.00749638,0.002556072,0.002139649,0.006725824],"category_scores_gemma":[0.01461215,0.001095391,0.002790549,0.001720862,0.006124679,0.01235877,0.004843495,0.006252555,0.0006605854],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001925347,"about_ca_system_score_gemma":0.002415915,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001737321,"about_ca_topic_score_gemma":0.001482528,"domain_scores_codex":[0.9947778,0.002111705,0.0005374143,0.001111472,0.0007868232,0.0006747143],"domain_scores_gemma":[0.9801333,0.01521763,0.000779572,0.001531336,0.001245391,0.001092768],"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.0001335796,0.00008954062,0.0002975737,0.00007983367,0.00002588902,0.0001332511,0.000527959,0.007329,0.0008788687,0.9842785,0.0006361922,0.005589785],"study_design_scores_gemma":[0.00003953306,0.0000247435,0.00007081615,0.00001220768,0.00001265825,0.00006511091,0.0001411035,0.0280956,0.0004554552,0.9705183,0.0005445572,0.00001995104],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3286051,0.0008982779,0.6397713,0.00301348,0.0002493582,0.0003288724,0.0007165019,0.0004925855,0.02592455],"genre_scores_gemma":[0.8775762,0.0005667822,0.1076211,0.0004167011,0.0002461821,0.000514231,0.001002035,0.0001524562,0.0119044],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00749638,"threshold_uncertainty_score":0.02547187,"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."}}