Hyper-Minimization for Deterministic Register Automata
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2026
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866918484445757440 |
|---|---|
| author | Li, Yong Tang, Qiyi Yen, Di-De |
| author_facet | Li, Yong Tang, Qiyi Yen, Di-De |
| contents | We investigate hyper-minimization for deterministic register automata (DRAs). We begin by introducing DRA counterparts of classical notions from deterministic finite automata. Building on these foundations, we present an algorithm for hyper-minimizing well-typed DRAs, where each state is associated with a unique register type. The resulting automata are minimal with respect to both the number of states and registers among all well-typed DRAs. We prove the correctness of the proposed algorithm, thereby establishing the decidability of hyper-minimization for well-typed DRAs. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2605_03535 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Hyper-Minimization for Deterministic Register Automata Li, Yong Tang, Qiyi Yen, Di-De Formal Languages and Automata Theory We investigate hyper-minimization for deterministic register automata (DRAs). We begin by introducing DRA counterparts of classical notions from deterministic finite automata. Building on these foundations, we present an algorithm for hyper-minimizing well-typed DRAs, where each state is associated with a unique register type. The resulting automata are minimal with respect to both the number of states and registers among all well-typed DRAs. We prove the correctness of the proposed algorithm, thereby establishing the decidability of hyper-minimization for well-typed DRAs. |
| title | Hyper-Minimization for Deterministic Register Automata |
| topic | Formal Languages and Automata Theory |
| url | https://arxiv.org/abs/2605.03535 |