Complexity measures defined by mazurkiewicz-algorithms
Part of the Lecture Notes in Computer Science book series (LNCS, volume 64)
KeywordsEffective Enumeration Regular Expression Complexity Measure Recursive Function Path Measure
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
- 1.Ausiello, G., Abstract computational complexity and cycling computations. JCSS 5 (1971) 118–128.Google Scholar
- 2.Biskup, J., Path measures of Turing machine computations. To be presented at the 5th Colloquium Automata, Languages and Programming, Udine, July 1978.Google Scholar
- 3.Blikle, A., An algebraic approach to programs and their computations. Proc. of Symp. and Summer School MFCS, High Tatras, September 3–8, 1973, 17–26.Google Scholar
- 4.Blikle, A., An extended approach to mathematical analysis of programs. CC PAS Reports 169, Warsaw 1974. Or: An analysis of programs by algebraic means. In: Banach Center Publications, Vol. 2, Warsaw 1977.Google Scholar
- 6.Eilenberg, S., Automata, languages and machines, vol. A. Academic Press, New York-London 1974.Google Scholar
- 7.Havel, I.M., Weak complexity measures. SIGACT News, January 1971, 21–30.Google Scholar
- 8.Lischke, G., Flußbildmaße — Ein Versuch zur Definition natürlicher Kompliziertheitsmaße. EIK 11 (1975) 423–436.Google Scholar
- 9.Rogers, H., Jr., Theory of recursive functions and effective computability. McGraw-Hill, New York 1967.Google Scholar
© Springer-Verlag Berlin Heidelberg 1978