It has been shown in previous recent work that multiplicity automata are predictable from multiplicity and equivalence queries. In this paper we generalize related notions in a matrix representation and obtain a basis for the solution of a number of open problems in learnability theory. Membership queries are generalized to ... more >>>