What do you call a function like $f:\{0,1\}^n→\{1, 2, 3, 4, 5\}$?
I'm trying to learn about logic minimization in order to build an optimization pass for a compiler, but all the techniques I've found are focused on functions with boolean input and output.
Algorithms like Quine–McCluskey seem to generalize straightforwardly, and I imagine that most heuristics will too, but I want to be sure there's not a whole body of thought that I'm missing.