Abstract
Recently, infinite time hierarchies of separated complexity classes in the range between real time and linear time have been shown. This result is generalized to arbitrary dimensions. Furthermore, for fixed time complexities of the form id+r, where r ∈ o(id) is a sublinear function, proper dimension hierarchies are presented. The hierarchy results are established by counting arguments. For an equivalence relation and a family of witness languages the number of induced equivalence classes is compared to the number of equivalence classes distinguishable by the model in question. By contradiction the properness of the inclusions is proved.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Balcázar, J.L., Díaz, J., Gabarró, J.: Structural Complexity I. Springer, Berlin (1988)
Book, R.V., Greibach, S.A.: Quasi-realtime languages. Math. Systems Theory 4, 97–111 (1970)
Buchholz, T., Klein, A., Kutrib, M.: Iterative arrays with small time bounds. In: Nielsen, M., Rovan, B. (eds.) MFCS 2000. LNCS, vol. 1893, pp. 243–252. Springer, Heidelberg (2000)
Cole, S.N.: Real-time computation by n-dimensional iterative arrays of finite-state machines. IEEE Trans. Comput. C-18, 349–365 (1969)
Fürer, M.: The tight deterministic time hierarchy. In: Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing (STOC 1982), pp. 8–16 (1982)
Hartmanis, J., Stearns, R.E.: On the computational complexity of algorithms. Trans. Amer. Math. Soc. 117, 285–306 (1965)
Hennie, F.C.: One-tape, off-line turing machine computations. Inform. Control 8, 553–578 (1965)
Hennie, F.C.: On-line turing machine computations. IEEE Trans. Elect. Comput. EC-15, 35–44 (1966)
Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Language,and Computation. Addison-Wesley, Reading (1979)
Klein, A., Kutrib, M.: Deterministic Turing machines in the range between real-time and linear-time. Theoret. Comput. Sci. 289, 253–275 (2002)
Kobayashi, K.: On proving time constructibility of functions. Theoret. Comput. Sci. 35, 215–225 (1985)
Loui, M.C.: Simulations among multidimensional turing machines. Theoret. Comput. Sci. 21, 145–161 (1982)
Michel, P.: An NP-complete language accepted in linear time by a one-tape Turing machine. Theoret. Comput. Sci. 85, 205–212 (1991)
Paul, W.J.: On time hierarchies. J. Comput. System Sci. 19, 197–202 (1979)
Paul, W., Seiferas, J.I., Simon, J.: An information-theoretic approach to time bounds for on-line computation. J. Comput. System Sci. 23, 108–126 (1981)
Pippenger, N., Fischer, M.J.: Relations among complexity measures. J. Assoc. Comput. Mach. 26, 361–381 (1979)
Reischuk, R.: Einführung in die Komplexitätstheorie. Teubner, Stuttgart (1990)
Rosenberg, A.L.: Real-time definable languages. J. Assoc. Comput. Mach. 14, 645–662 (1967)
Stoß, H.-J.: Zwei-Band Simulation von Turingmaschinen. Computing 7, 222–235 (1971)
Wagner, K., Wechsung, G.: Computational Complexity. Reidel, Dordrecht (1986)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kutrib, M. (2003). Dimension- and Time-Hierarchies for Small Time Bounds. In: Lingas, A., Nilsson, B.J. (eds) Fundamentals of Computation Theory. FCT 2003. Lecture Notes in Computer Science, vol 2751. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45077-1_30
Download citation
DOI: https://doi.org/10.1007/978-3-540-45077-1_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40543-6
Online ISBN: 978-3-540-45077-1
eBook Packages: Springer Book Archive