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.
@inproceedings{JirickaK99,
title = {Deterministic forgetting planar automata are more powerful than non-deterministic finite-state planar automata},
author = {Petr Jiricka and Jaroslav Král},
year = {1999},
researchr = {https://researchr.org/publication/JirickaK99},
cites = {0},
citedby = {0},
pages = {71-80},
booktitle = {Developments in Language Theory, Foundations, Applications, and Perspectives, Aachen, Germany, 6-9 July 1999},
editor = {Grzegorz Rozenberg and Wolfgang Thomas},
publisher = {World Scientific},
isbn = {981-02-4380-4},
}