An algorithm hyper-minimizes well-typed DRAs to achieve minimality in states and registers while proving decidability of the problem.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.FL 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Hyper-Minimization for Deterministic Register Automata
An algorithm hyper-minimizes well-typed DRAs to achieve minimality in states and registers while proving decidability of the problem.