TY  - JOUR
AU  - Monien, Burkhard
DA  - 2009
DP  - Universität Paderborn
LA  - eng
M2  - 371
PY  - 2009
SN  - 0001-5903
SP  - 371-382
T2  - Acta Informatica
TI  - The LBA-problem and the deterministic tape complexity of two-way one-counter languages over a one-letter alphabet
UR  - https://nbn-resolving.org/urn:nbn:de:hbz:466:2-4357
Y2  - 2026-01-17T22:29:44
ER  -