A Recursive Padding Technique on Nondeterministic Cellular Automata

Authors:
Chuzo Iwamoto;Harumasa Yoneda;Kenichi Morita;Katsunobu Imai
Affiliations:
-;-;-;-
Venue:
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Year:
2008

Citing 15
Cited 0

Theory of recursive functions and effective computability

Theory of recursive functions and effective computability
A six-state minimal time solution to the firing squad synchronization problem

Theoretical Computer Science
A Note Concerning Nondeterministic Tape Complexities

Journal of the ACM (JACM)
Separating Nondeterministic Time Complexity Classes

Journal of the ACM (JACM)
Introduction to the Theory of Computation

Introduction to the Theory of Computation
Constructible functions in cellular automata and their applications to hierarchy results

Theoretical Computer Science
Improved Time and Space Hierarchies of One-Tape Off-Line TMs

MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
Computational Complexity in the Hyperbolic Plane

MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
New Time Hierarchy Results for Deterministic TMs

STACS '92 Proceedings of the 9th Annual Symposium on Theoretical Aspects of Computer Science
Parallel Complexity Hierarchies Based on PRAMs and DLOGTIME-Uniform Circuits

CCC '96 Proceedings of the 11th Annual IEEE Conference on Computational Complexity
The tight deterministic time hierarchy

STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
NONDETERMINISTIC TIME AND SPACE COMPLEXITY CLASSES

NONDETERMINISTIC TIME AND SPACE COMPLEXITY CLASSES
Translational lemmas for DLOGTIME-uniform circuits, alternating TMs, and PRAMs

Acta Informatica
Hierarchies of DLOGTIME-uniform circuits

MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
Translational lemmas for alternating TMs and PRAMs

FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a tight time-hierarchy theorem for nondeterministic cellular automata by using a recursive padding argument. It is shown that, if t2(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.