A note on complexity of algorithmic nets without cycles. (English) Zbl 0234.68019


68Q25 Analysis of algorithms and problem complexity
68R10 Graph theory (including graph drawing) in computer science
Full Text: EuDML


[1] Blikle A.: Addressless units for carrying out loop-free computations. pp. 48, Polish Academy of Sciences, Institute of Mathematics, July 1970. · Zbl 0231.68010
[2] Čulík K.: Combinatorial problems in theory of complexity of algorithmic nets without cycles for simple computers. Aplikace matematiky 16 (1971), 188 - 202. · Zbl 0231.68022
[3] Čulík K.: On semantics of programming languages. Automatentheorie und formale Sprachen J. Dörr, G. Hotz, Bibliographisches Institut, Mannheim- Wien- Zurich, 1970, pp. 291-303.
[4] Čulík K.: Structural similarity of programs and some concepts of algorithmic metod. preprint of a lecture presented at the GI - Conference in Munich, March 1971.
[5] Sethi R., Ullman J. D.: The generation of optimal code for arithmetic expressions. Jour. of ACM, vol. 17, No. 4, October 1970, pp. 715-728. · Zbl 0212.18802
[6] Čulík K.: Theory of programming languages and of algorithms. a textbook for Institute of Technology in Prague (in print), July 1970.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.