A Recursive Padding Technique on Nondeterministic Cellular Automata

Chuzo IWAMOTO; Harumasa YONEDA; Kenichi MORITA; Katsunobu IMAI

doi:10.1093/ietfec/e91-a.9.2335

Special Section on Discrete Mathematics and Its Applications

A Recursive Padding Technique on Nondeterministic Cellular Automata

Chuzo IWAMOTO, Harumasa YONEDA, Kenichi MORITA, Katsunobu IMAI

著者情報

キーワード: cellular automata, computational complexity, hierarchy theorem

ジャーナル認証あり

2008 年 E91.A 巻 9 号 p. 2335-2340

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

詳細

抄録

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.

責任著者(Corresponding author)

J-STAGEへの登録はこちら（無料）