Hyper-Minimization for Deterministic Register Automata
Formal Languages and Automata Theory
2026-05-06 v1
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.
Keywords
Cite
@article{arxiv.2605.03535,
title = {Hyper-Minimization for Deterministic Register Automata},
author = {Yong Li and Qiyi Tang and Di-De Yen},
journal= {arXiv preprint arXiv:2605.03535},
year = {2026}
}