One-Clock Deterministic Timed Automata Are Efficiently Identifiable in the Limit.

Sicco Verwer Mathijs de Weerdt Cees Witteveen One-Clock Deterministic Timed Automata Are Efficiently Identifiable in the Limit. 740-751 2009 LATA http://dx.doi.org/10.1007/978-3-642-00982-2_63 conf/lata/2009 db/conf/lata/lata2009.html#VerwerWW09