2 papers
cs.FL2026
Minimality of Random Moore Automata under Prefix-Dependent Congruences
Matías Carrasco, Sergio Yovine
We study prefix-dependent congruences for random deterministic transition systems with state outputs. In this setting, the admissible continuations used to compare two states may d…
cs.FL2024
Congruence-based Learning of Probabilistic Deterministic Finite Automata
Matías Carrasco, Franz Mayr, Sergio Yovine
This work studies the question of learning probabilistic deterministic automata from language models. For this purpose, it focuses on analyzing the relations defined on algebraic s…