Deterministic forgetting planar automata are more powerful than non-deterministic finite-state planar automata. - Petr Jiricka; Jaroslav Král (Developments in Language Theory, 1999)