{"id":"W2028475750","doi":"10.1016/j.tcs.2012.04.002","title":"One-reversal counter machines and multihead automata: Revisited","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"ca_institutions":"Western University; Google (Canada)","funders":"","keywords":"Pushdown automaton; Deterministic pushdown automaton; Deterministic context-free grammar; Computer science; Nested word; Finite-state machine; Embedded pushdown automaton; Deterministic finite automaton; Counterexample; Theoretical computer science; Automaton; Algorithm; Discrete mathematics; Automata theory; Mathematics; Quantum finite automata; Programming language; Nondeterministic finite automaton; Parsing; Context-free grammar","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.002257813,0.0002292408,0.0002732588,0.0001811797,0.0004032714,0.0005623359,0.001793328,0.0000649301,0.00004693105],"category_scores_gemma":[0.00009083032,0.000188293,0.000055566,0.000765424,0.002175373,0.00197545,0.001601478,0.000206239,0.0001381278],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004543667,"about_ca_system_score_gemma":0.00004159024,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005298009,"about_ca_topic_score_gemma":1.636824e-7,"domain_scores_codex":[0.9974232,0.0001392169,0.0002848873,0.0006411425,0.0006620061,0.0008495742],"domain_scores_gemma":[0.9981168,0.0003132802,0.00007423782,0.0009149391,0.0001036676,0.0004770687],"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.000005243406,0.00008740765,0.0005292643,0.00001316527,0.000005093814,0.00000304843,0.0005459056,0.000002287248,0.000997527,0.9257851,0.0001364593,0.07188948],"study_design_scores_gemma":[0.0005075761,0.0001444501,0.01974174,0.0000870498,0.00001298064,0.0001343706,0.000007305076,0.9189241,0.00181479,0.05732867,0.000811207,0.0004857928],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1237875,0.0003497544,0.8712418,0.001093666,0.0008395099,0.0001789437,0.000003895723,0.0005233115,0.001981581],"genre_scores_gemma":[0.8695226,0.00001828544,0.1287991,0.001354781,0.0002788867,0.000004614431,0.000001067146,0.000009972935,0.00001062748],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9189218,"threshold_uncertainty_score":0.8015253,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01136896887461273,"score_gpt":0.2533445139941322,"score_spread":0.2419755451195195,"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."}}