The research reported here was supported in part by the National Science Foundation under Grant MCS77-11360.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Baker, T., Gill, J. and Solovay, R., Relativization of the P = ? NP question. SIAM J. Computing, 4(1975), 431–422.
Baker, T. and Selman, A., A second step towards the polynomial hierarchy. Theoret. Comput. Sci., to appear.
Book, R., Simple representations of certain classes of languages. J. Assoc. Comput. Mach., 25(1978), 23–31.
Book, R., Polynomial space and transitive closure. SIAM J. Computing, 8(1979), to appear.
Book, R., On languages accepted by space-bounded oracle machines. Acta Informatica, to appear.
Book, R., Time, space, and relativizations. In preparation.
Book, R., Greibach, S. and Wrathall, C., Reset machines. J. Comput. System Sci., to appear.
Book, R. and Nivat, M., Linear languages and the intersection closures of classes of languages. SIAM J. Computing, 7(1978), 167–177.
Book, R., Nivat, M. and Paterson, M., Reversal-bounded acceptors and intersections of linear languages. SIAM J. Computing, 3(1974), 283–295.
Book, R. and Wrathall, C., On languages specified by relative acceptance. Theoret. Comput. Sci., 7(1978), 185–195.
Ginsburg, S., Greibach, S. and Hopcroft, J., Studies in Abstract Families of Languages, Memoir No. 87, Amer. Math. Soc., 1969.
Grzegorczyk, A., Some classes of recursive functions. Rozprawy Matematyczne, IV(1953), 1–46.
Jones, N., Formal Languages and Rudimentary Attributes, Ph.D. dissertation, University of Western Ontario, 1967.
Jones, N., Classes of automata and transitive closure. Info. Control, 13(1968), 207–229.
Kleene, S.C., Introduction to Metamathematics. Van Nostrand, Princeton, N.J., 1952.
McCloskey, T., Abstract families of length-preserving processors. J. Comput. System Sci., 10(1975), 394–427.
Rogers, H., Theory of Recursive Functions and Effective Computability. McGraw-Hill, New York, 1967.
Simon, I., On Some Subrecursive Reducibilities, Ph.D. dissertation, Stanford University, 1977.
Simon, I. and Gill, J., Polynomial reducibilities and upwards diagonalizations. Proc. 9th ACM Symp. Theory of Computing (1977), 186–194.
Stockmeyer, L., The polynomial-time hierarchy. Theoret. Comput. Sci., 3(1976), 1–22.
Wrathall, C., Subrecursive Predicates and Automata, Ph.D. dissertation, Harvard University, 1975.
Wrathall, C., Complete sets and the polynomial-time hierarchy. Theoret. Comput. Sci., 3(1976), 23–33.
Wrathall, C., Rudimentary predicates and relative computation. SIAM J. Computing, 7(1978), 194–209.
Wrathall, C., The linear and polynomial-time hierarchies. In preparation.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1979 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Book, R.V. (1979). Complexity classes of formal languages. In: Bečvář, J. (eds) Mathematical Foundations of Computer Science 1979. MFCS 1979. Lecture Notes in Computer Science, vol 74. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-09526-8_4
Download citation
DOI: https://doi.org/10.1007/3-540-09526-8_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-09526-2
Online ISBN: 978-3-540-35088-0
eBook Packages: Springer Book Archive