TY - JOUR AU - JanĨar, Petr TI - Nondeterministic forgetting automata are less powerful than deterministic linear bounded automata JO - Communications in Mathematics PY - 1993 SP - 67 EP - 73 VL - 01 IS - 1 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/COMIM_1993__1_1_a7/ LA - en ID - COMIM_1993__1_1_a7 ER -