Abstract
We present a tight time-hierarchy theorem for nondeterministic cellular automata by using a recursive padding argument. It is shown that, if t 2(n) is a time-constructible function and t 2(n) grows faster than t 1(nā+ā1), then there exists a language which can be accepted by a t 2(n)-time nondeterministic cellular automaton but not by any t 1(n)-time nondeterministic cellular automaton.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
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.
References
Cook, S.A.: A hierarchy for nondeterministic time complexity. J. Comput. System Sci.Ā 7, 343ā353 (1973)
Cook, S.A., Reckhow, R.A.: Time bounded random access machines. J. Comput. System Sci.Ā 7, 354ā375 (1973)
FĆ¼rer, M.: The tight deterministic time hierarchy. In: Proc. ACM Symp. on Theory of Computing, 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. Contr.Ā 8, 553ā578 (1965)
Ibarra, O.H.: A note concerning nondeterministic tape complexity. J. Assoc. Comput. Mach.Ā 19, 608ā612 (1972)
Iwama, K., Iwamoto, C.: Parallel complexity hierarchies based on PRAMs and DLOGTIME-uniform circuits. In: Proc. 11th IEEE Conf. on Computational Complexity, pp. 24ā32 (1996)
Iwama, K., Iwamoto, C.: Improved time and space hierarchies of one-tape off-line TMs. In: Brim, L., Gruska, J., ZlatuÅ”ka, J. (eds.) MFCS 1998. LNCS, vol.Ā 1450, pp. 580ā588. Springer, Heidelberg (1998)
Iwamoto, C., et al.: Computational complexity in the hyperbolic plane. In: Diks, K., Rytter, W. (eds.) MFCS 2002. LNCS, vol.Ā 2420, pp. 365ā374. Springer, Heidelberg (2002)
Iwamoto, C., et al.: Hierarchies of DLOGTIME-uniform circuits. In: Margenstern, M. (ed.) MCU 2004. LNCS, vol.Ā 3354, pp. 211ā222. Springer, Heidelberg (2005)
Iwamoto, C., et al.: Constructible functions in cellular automata and their applications to hierarchy results. Theoret. Comput. Sci.Ā 270, 797ā809 (2002)
Iwamoto, C., Margenstern, M.: Time and space complexity classes of hyperbolic cellular automata. IEICE Trans. on Information and SystemsĀ E87-D(3), 700ā707 (2004)
Iwamoto, C., et al.: Translational lemmas for alternating TMs and PRAMs. In: LiÅkiewicz, M., Reischuk, R. (eds.) FCT 2005. LNCS, vol.Ā 3623, pp. 126ā137. Springer, Heidelberg (2005)
LoryÅ, K.: New time hierarchy results for deterministic TMs. In: Finkel, A., Jantzen, M. (eds.) STACS 1992. LNCS, vol.Ā 577, pp. 329ā336. Springer, Heidelberg (1992)
Mazoyer, J.: A 6-state minimal time solution to the firing squad synchronization problem. Theoret. Comput. Sci.Ā 50, 183ā238 (1987)
Paul, W.J.: On time hierarchies. J. Comput. System Sci.Ā 19, 197ā202 (1979)
Paul, W.J., PrauĆ, E.J., Reischuk, R.: On alternation. Acta Inform.Ā 14, 243ā255 (1980)
Rogers Jr., H.: Theory of recursive functions and effective computability. McGraw-Hill, New York (1967)
Seiferas, J.I.: Nondeterministic time and space complexity classes. MIT-LCS-TR-137, Proj.Ā MAC, MIT, Cambridge, Mass. (Sept. 1974)
Seiferas, J.I., Fischer, M.J., Meyer, A.R.: Separating nondeterministic time complexity classes. J. Assoc. Comput. Mach.Ā 25(1), 146ā167 (1978)
Sipser, M.: Introduction to the theory of computation. PWS Publishing, Boston (1997)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
Ā© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Iwamoto, C., Yoneda, H., Morita, K., Imai, K. (2007). A Time Hierarchy Theorem for Nondeterministic Cellular Automata. In: Cai, JY., Cooper, S.B., Zhu, H. (eds) Theory and Applications of Models of Computation. TAMC 2007. Lecture Notes in Computer Science, vol 4484. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72504-6_46
Download citation
DOI: https://doi.org/10.1007/978-3-540-72504-6_46
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72503-9
Online ISBN: 978-3-540-72504-6
eBook Packages: Computer ScienceComputer Science (R0)