Computational Universality in One-variable Language Equations

It is proved that the universality and the associated hardness of decision problems begins at one-variable equations, and it is shown that language equations with added quotient with regular languages can specify every set representable in first-order Peano arithmetic.