Deterministic forgetting planar automata are more powerful than non-deterministic finite-state planar automata
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter

Petr Jiricka, Jaroslav Král
Deterministic forgetting planar automata are more powerful than non-deterministic finite-state planar automata
DLT, 1999.

DLT 1999
DBLP
Scholar
Full names Links ISxN
@inproceedings{DLT-1999-JirickaK,
	author        = "Petr Jiricka and Jaroslav Král",
	booktitle     = "{Proceedings of the Fourth International Conference on Developments in Language Theory, Foundations, Applications, and Perspectives}",
	isbn          = "981-02-4380-4",
	pages         = "71--80",
	publisher     = "{World Scientific}",
	title         = "{Deterministic forgetting planar automata are more powerful than non-deterministic finite-state planar automata}",
	year          = 1999,
}

Tags:



Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.