Deterministic two-way one-head pushdown automata are very powerful
Information Processing Letters - Lecture Notes in Computer Science, no. 173
Two-Way Counter Machines and Diophantine Equations
Journal of the ACM (JACM)
Analysis of Algorithms and Data and Structures
Analysis of Algorithms and Data and Structures
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
Theoretical Computer Science
Generalized counters and reversal complexity
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
| Hi-index | 0.00 |
We show that languages such as &Ltilde; = {0n1n2|n≥ 1} and &Lcirc; = {0n12n|n≥ 1} can be accepted by deterministic two-way one-counter automata.