“…The characterization of the context-free languages as least solutions of algebraic inequalities involving µ goes back to a 1971 paper of Gruska [4]. More recently, several researchers have given equational axioms for semirings with µ and have developed fragments of the equational theory of context-free languages [3,5,6,7,8,9].…”