Regular languages form a dense, incomplete ultrametric subspace of all formal languages, and guarded fixed-point iteration produces finite automata with certified agreement up to a specified word length.
The Metrical Space of Events
1 Pith paper cite this work, alongside 8 external citations. Polarity classification is still indexing.
1
Pith paper citing it
8
external citations · OpenAlex
fields
cs.FL 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Ultrametric Convergence of Guarded Automata and Applications to Structural Input Validation
Regular languages form a dense, incomplete ultrametric subspace of all formal languages, and guarded fixed-point iteration produces finite automata with certified agreement up to a specified word length.