Scholarlink

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 \(\mathsf {L^*}\) style algorithms that learn the canonical \(1\) -DTA.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

A Myhill-Nerode Characterization and Active Learning for One-Clock Timed Automata

  • 会议论文

  • 出版模式：

    开放获取

  • 发表日期：

    2026年

查看全文
  • Kyveli Doveri,
  • Pierre Ganty,
  • B. Srivathsan

摘要

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 \(\mathsf {L^*}\) style algorithms that learn the canonical \(1\) -DTA.