𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Automata-based computational complexity

✍ Scribed by J. Hartmanis; R.E. Stearns

Book ID
107766329
Publisher
Elsevier Science
Year
1969
Tongue
English
Weight
729 KB
Volume
1
Category
Article
ISSN
0020-0255

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the Computational Complexity of P Aut
On the Computational Complexity of P Automata
✍ ErzsΓ©bet Csuhaj-VarjΓΊ; Oscar H. Ibarra; GyΓΆrgy Vaszil πŸ“‚ Article πŸ“… 2006 πŸ› Springer Netherlands 🌐 English βš– 296 KB
On the Computational Complexity of Finit
On the Computational Complexity of Finite Cellular Automata
✍ K. Sutner πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 932 KB

We study the computational complexity of several problems with the evolution of configurations on finite cellular automata. In many cases, the problems turn out to be complete in their respective classes. For example, the problem of deciding whether a configuration has a predecessor is shown to be N