Active Learning of Deterministic Transducers with Outputs in Arbitrary Monoids
<|reference_start|>Active Learning of Deterministic Transducers with Outputs in Arbitrary Monoids: We study monoidal transducers, transition systems arising as deterministic automata whose transitions also produce outputs in an arbitrary monoid, for instance allowing outputs to commute or to cancel out. We use the categorical framework for minimization and learning of Colcombet, Petri\c{s}an and Stabile to recover the notion of minimal transducer recognizing a language, and give necessary and sufficient conditions on the output monoid for this minimal transducer to exist and be unique (up to isomorphism). The categorical framework then provides an abstract algorithm for learning it using membership and equivalence queries, and we discuss practical aspects of this algorithm's implementation.<|reference_end|>
@article{aristote2024active,
    title={Active Learning of Deterministic Transducers with Outputs in Arbitrary
  Monoids},
    author={Quentin Aristote (Universit'e Paris Cit'e, CNRS, Inria, IRIF,
  F-75013, Paris, France)},
    journal={arXiv preprint arXiv:2410.01590},
    year={2024},
    doi={10.4230/LIPIcs.CSL.2024.11},
    archivePrefix={arXiv},
    eprint={2410.01590},
    primaryClass={cs.FL}
}