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 t2(n) grows faster than t1(n + 1), then there exists a language which can be accepted by a t2(n)-time nondeterministic cellular automaton but not by any t1 (n)-time nondeterministic cellular automaton. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Iwamoto, C., Yoneda, H., Morita, K., & Imai, K. (2007). A time hierarchy theorem for nondeterministic cellular automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4484 LNCS, pp. 511–520). Springer Verlag. https://doi.org/10.1007/978-3-540-72504-6_46
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
