Optimal rasp programs for arbitrarily complex 0–1 valued functions
Part of the Lecture Notes in Computer Science book series (LNCS, volume 53)
KeywordsOptimal Program Total Function Sive Function Random Access Machine Instruction Counter
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.
- 3.Cook, S. A., Computational complexity using random access machines, Course Notes, University of California, Berkeley, 1970.Google Scholar
- 4.Cook, S. A., Linear-time simulation of deterministic two-way pushdown automata, Proc. IFIP congr. 71, Foundations of Information Processing, North-Holl., 1972.Google Scholar
- 7.Engeler, E., Introduction to the Theory of Computing, Acad. Press, 1973, pp. 172–189.Google Scholar
- 8.Sudborough, I. H. and Zalcberg, A., On families of languages defined by time-bounded random access machines — the second part of this paper which has three versions: 1st ver.: TR, Dept. Comp. Sciences, The Techn. Inst., Northwest, Univ., Evanston, Illin., USA, 1973.; 2nd ver.: 2nd MFCS Symp., High Tatr., CSSR, 1973.; 3rd ver.: SIAM J. Comp., 5 (1976), 217–230, sect. 3 (223–230).CrossRefGoogle Scholar
- 9.Horváth, S., Complexity of sequence encodings, to be presented at the int.-l conf. Fundamentals of Computation Theory, Poznań-Kórnik, Poland, September 19–23, 1977; the proc. of the conf. will appear as a volume of Springer Lect. Notes Comp. Sci., 1977.Google Scholar
© Springer-Verlag Berlin Heidelberg 1977