22 citations · 44 across the 8 of their papers we have counts for
4 papers · 1 filter
Orbit-Finite-Dimensional Vector Spaces and Weighted Register Automata
Mikołaj Bojańczyk, Joanna Fijalkow, Bartek Klin +1
We develop a theory of vector spaces spanned by orbit-finite sets. Using this theory, we give a decision procedure for equivalence of weighted register automata, which are the comm…
Residuality and Learning for Nondeterministic Nominal Automata
Joshua Moerman, Matteo Sammartino
We are motivated by the following question: which data languages admit an active learning algorithm? This question was left open in previous work by the authors, and is particularl…
A (co)algebraic theory of succinct automata
Gerco van Heerdt, Joshua Moerman, Matteo Sammartino +1
The classical subset construction for non-deterministic automata can be generalized to other side-effects captured by a monad. The key insight is that both the state space of the d…
Learning Nominal Automata
Joshua Moerman, Matteo Sammartino, Alexandra Silva +2
We present an Angluin-style algorithm to learn nominal automata, which are acceptors of languages over infinite (structured) alphabets. The abstract approach we take allows us to s…