We present a Myhill-Nerode style characterization for languages recognized by one-clock deterministic timed automata (1-DTA). Although there is only one clock, distinct automata may reset it differently along the same word. This adds a significant challenge in the search for a canonical automaton. Our characterization is based on a new perspective of 1-DTAs in terms of "half-integral" words that they accept, along with the reset information encoded by them. We apply our results to develop L* style algorithms that learn the canonical 1-DTA.

翻译：本文针对单时钟确定性定时自动机（1-DTA）所识别的语言，提出了一种Myhill-Nerode风格的刻画。尽管只有一个时钟，不同的自动机在同一词上可能以不同的方式重置该时钟。这为寻找规范自动机带来了显著挑战。我们的刻画基于一个关于1-DTA的新视角，即它们所接受的“半整数”词，以及这些词所编码的重置信息。我们应用所得结果，开发了用于学习规范1-DTA的L*风格算法。