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 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.
机构:
Department of Computer Science and Engineering, University of Bologna, ItalyDepartment of Computer Science and Engineering, University of Bologna, Italy