Hyper-Minimization for Deterministic Register Automata
For researchers in automata theory and verification, this work extends hyper-minimization to a more expressive model, but it is incremental as it builds on classical DFA concepts and is restricted to well-typed DRAs.
The paper introduces hyper-minimization for deterministic register automata (DRAs), providing an algorithm that reduces both states and registers among well-typed DRAs, and proves its correctness, establishing decidability.
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.