Abstract
By a net (in a sense of Blikle) we mean a complete lattice with a continuous and distributive semigroup operation called composition.
The paper contains an investigation of algebraic properties of nets and Mazurkiewicz algorithms over nets. The free objects and the amalgamation property are analysed.
It is proved (on the basis of an appropriate theorem from the theory of formal languages) that a certain equivalence of schemas of finite-control Mazurkiewicz algorithms is not partially solvable.
Get full access to this article
View all access options for this article.