Under independent uniform random transitions and labels with agreement probability strictly less than one and at least three admissible symbols each, the induced prefix-dependent congruence on random Moore automata is trivial with high probability.
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
-
Minimality of Random Moore Automata under Prefix-Dependent Congruences
Under independent uniform random transitions and labels with agreement probability strictly less than one and at least three admissible symbols each, the induced prefix-dependent congruence on random Moore automata is trivial with high probability.