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

Sicco Verwer, Mathijs de Weerdt, Cees Witteveen

Browse the full LATA paper archive.