One-Clock Deterministic Timed Automata Are Efficiently Identifiable in the Limit
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

Sicco Verwer, Mathijs de Weerdt, Cees Witteveen
One-Clock Deterministic Timed Automata Are Efficiently Identifiable in the Limit
LATA, 2009.

LATA 2009
DBLP
Scholar
DOI
Full names Links ISxN
@inproceedings{LATA-2009-VerwerWW,
	author        = "Sicco Verwer and Mathijs de Weerdt and Cees Witteveen",
	booktitle     = "{Proceedings of the Third International Conference on Language and Automata Theory and Applications}",
	doi           = "10.1007/978-3-642-00982-2_63",
	isbn          = "978-3-642-00981-5",
	pages         = "740--751",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{One-Clock Deterministic Timed Automata Are Efficiently Identifiable in the Limit}",
	volume        = 5457,
	year          = 2009,
}

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.