3 citations · 5 across the 4 of their papers we have counts for
4 papers · 1 filter
Learning Weighted Automata over Number Rings, Concretely and Categorically
Quentin Aristote, Sam van Gool, Daniela Petrişan +1
We develop a generic reduction procedure for active learning problems. Our approach is inspired by a recent polynomial-time reduction of the exact learning problem for weighted aut…
Learning automata and transducers: a categorical approach
Thomas Colcombet, Daniela Petrişan, Riccardo Stabile
In this paper, we present a categorical approach to learning automata over words, in the sense of the -algorithm of Angluin. This yields a new generic -like algorithm whi…
Automata in the Category of Glued Vector Spaces
Thomas Colcombet, Daniela Petrişan
In this paper we adopt a category-theoretic approach to the conception of automata classes enjoying minimization by design. The main instantiation of our construction is a new clas…
Automata Minimization: a Functorial Approach
Thomas Colcombet, Daniela Petrişan
In this paper we regard languages and their acceptors -- such as deterministic or weighted automata, transducers, or monoids -- as functors from input categories that specify the t…