  The present work points out that the Deutsch-Jozsa algorithm was the first
formal description of a quantum decider. In particular, it is studied here the
class of languages whose indicator functions allow the Deutsch-Jozsa algorithm
to output a monochromatic result, beyond the trivial case z = 0 for constant
indicator functions. To illustrate examples of randomly balanced languages and
some monochromatic cases, it was performed classical computational simulations
of the Deutsch-Jozsa quantum algorithm for the specific cases of 4 and 6
qubits, respectively. The general case of the Deutsch-Jozsa decided languages
are named balanced languages, and their outcomes from the simulation suggest
that such languages are equivalent to the quantum superposition of the
monochromatic cases.
