Some remarks on deterministic Mazurkiewicz algorithms and languages associated with them

The paper deals with a class of programs called deterministic Mazurkiewicz algorithms. It considers languages associated with such algorithms by using symbols instead of actual relations and concatenation of words rather than composition of actual relations. It is shown that the class of languages so generated is precisely the class of simple context-free languages of Korenjak and Hoperoft [8].