Learning 1-DTA

All known algorithms for learning deterministic one clock timed automata (1-DTA) using equivalence and membership queries and without making assumptions on the teacher, require an exponential number of membership queries in the worst case. Prove that it is not possible to do better than that.