%0 Journal Article %A JanĨar, Petr %T Nondeterministic forgetting automata are less powerful than deterministic linear bounded automata %J Communications in Mathematics %D 1993 %P 67-73 %V 01 %N 1 %I mathdoc %U http://geodesic.mathdoc.fr/item/COMIM_1993__1_1_a7/ %G en %F COMIM_1993__1_1_a7