Ultrametric Convergence of Guarded Automata and Applications to Structural Input Validation
This work equips language-equivalence classes of deterministic finite automata with a distinguishing-word ultrametric and identifies the resulting space isometrically with the regular languages, and outlines a practical WAF pipeline combining learned grammar models, finite-state construction, and \(O(1)\)-memory runtim...