Hyper-Minimization for Deterministic Register Automata

1^st October 2026, 11:00 Ashton 208
Di-de Yen
Liverpool

Abstract

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.

Joint work with Yong Li and Qiyi Tang.