To understand this paper, it is necessary to appreciate the importance of algebraic dissections of string languages and their significance for theoretical computer science via the inherent links to formal languages and automata.

This paper is notable in two major respects. First, it is scientifically important in delivering new results and proving old hypotheses. The paper presents a nontrivial axiomatization for the equational theory of binoid languages. A conjecture from previous work is proven: the identical laws of ordinary (string) languages, written separately using horizontal and vertical operation symbols, form a required complete system of axioms. Second, the paper is very well written. Apart from the impeccable technical presentation, the author presents us with a style in which the examples and proofs are kept brief without omitting any crucial steps.

In the tradition of some schools, the paper does not include a conclusion; rather, all expectations are well outlined in the introductory section. In conclusion, I would like to note that it is important for professionals to expose themselves to papers that might have scary titles, as they can be rich with concepts. Although one may not understand the intricacy of the proofs on the first reading, he or she will definitely understand why the research is important.