Constructible functions in cellular automata and their applications to hierarchy results☆
Under an Elsevier user license
open archive
Keywords
Cellular automata
Time constructibility
Complexity hierarchy
Cited by (0)
- ☆
An extended summary of this paper appeared in the Proceedings of the 12th International Symposium on Fundamentals of Computation Theory, Lecture Notes in Computer Science, vol. 1684, August/September 1999. This research was supported in part by Scientific Research Grant, Ministry of Education, Japan.
Copyright © 2002 Elsevier Science B.V. All rights reserved.