47 citations · 115 across the 13 of their papers we have counts for
3 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…
A non-regular language of infinite trees that is recognizable by a sort-wise finite algebra
Mikołaj Bojańczyk, Bartek Klin
-clones are multi-sorted structures that naturally emerge as algebras for infinite trees, just as -semigroups are convenient algebras for infinite words. In the algebraic the…
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…