Algorithmic nets (or flow diagrams) are a generalization of logical nets. They are finite, oriented and acyclic graphs or multigraphs with labelled vertices and edges. Certain total orderings of their vertices are called courses (or programs). The following measures of complexity of a course (together with certain chromatic decomposition of certain interval graph) are introduced: its length is the number of its vertices; its width is the maximal degree of a complete subgraph in the interval graph; its capacity of storage is the number of elements of the decomposition and the non-efficiencies of its scopes or of its addresses.
 K. Čulík: On semanitics of programming languages
. J. Dörr, G. Hotz: Automatentheorie und formale Sprachen, Bibliographisches Institut AG, Mannheim 1970, 291-302. MR 0421123
 K. Čulík V. Doležal M. Fiedler: Combinatorial analysis in praxis. (Czech), SNTL, Prague 1967.
 K. Čulík: On some transformations in context-free grammars and languages
. Czech. Math. Jour. 17 (1967), Academia, 278-311. MR 0214410
 K. Čulík: Zur Theorie der Graphen
. Čas. pro pěst. mat. 83 (1958), 133-155. MR 0097805
 C. Berge: Théorie des graphes et ses applications
. Dunod, Paris 1958. MR 0102822
 R. Sethi J. D. Ullman: The Generation of Optimal Code for Arithmetic Expressions
. Journal of ACM, Vol. 17, No. 4, October 1970, pp. 715-728. DOI 10.1145/321607.321620
| MR 0275722
 A. Blikle: Addressless units for carrying out loop-free computations. Polish Academy of Sciences, Institute of Mathematics, July 1970, Warsaw.