Deterministic forgetting planar automata are more powerful than non-deterministic finite-state planar automata

Petr Jiricka, Jaroslav Král. Deterministic forgetting planar automata are more powerful than non-deterministic finite-state planar automata. In Grzegorz Rozenberg, Wolfgang Thomas, editors, Developments in Language Theory, Foundations, Applications, and Perspectives, Aachen, Germany, 6-9 July 1999. pages 71-80, World Scientific, 1999.

Abstract

Abstract is missing.