Finding Lower Bounds for Nondeterministic State Complexity Is Hard
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

Hermann Gruber, Markus Holzer
Finding Lower Bounds for Nondeterministic State Complexity Is Hard
DLT, 2006.

DLT 2006
DBLP
Scholar
DOI
Full names Links ISxN
@inproceedings{DLT-2006-GruberH,
	author        = "Hermann Gruber and Markus Holzer",
	booktitle     = "{Proceedings of the 10th International Conference on Developments in Language Theory}",
	doi           = "10.1007/11779148_33",
	isbn          = "3-540-35428-X",
	pages         = "363--374",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Finding Lower Bounds for Nondeterministic State Complexity Is Hard}",
	volume        = 4036,
	year          = 2006,
}

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.