A Recursive Padding Technique on Nondeterministic Cellular Automata

Chuzo IWAMOTO; Harumasa YONEDA; Kenichi MORITA; Katsunobu IMAI

doi:10.1093/ietfec/e91-a.9.2335

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Online ISSN : 1745-1337
Print ISSN : 0916-8508

Special Section on Discrete Mathematics and Its Applications

A Recursive Padding Technique on Nondeterministic Cellular Automata

Chuzo IWAMOTO, Harumasa YONEDA, Kenichi MORITA, Katsunobu IMAI

Author information

Keywords: cellular automata, computational complexity, hierarchy theorem

JOURNAL RESTRICTED ACCESS

2008 Volume E91.A Issue 9 Pages 2335-2340

DOI https://doi.org/10.1093/ietfec/e91-a.9.2335

Details

Abstract

We present a tight time-hierarchy theorem for nondeterministic cellular automata by using a recursive padding argument. It is shown that, if t₂(n) is a time-constructible function and t₂(n) grows faster than t₁(n+1), then there exists a language which can be accepted by a t₂(n)-time nondeterministic cellular automaton but not by any t₁(n)-time nondeterministic cellular automaton.

Content from these authors

Favorites & Alerts

Corresponding author

Register with J-STAGE for free!