Abstract

We show that languages such as &Ltilde; = {0 n 1 n 2 | n ≥ 1} and &Lcirc; = {0 n 1 2 n | n ≥ 1} can be accepted by deterministic two-way one-counter automata.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call