𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the Complexity of 2-Monotone Restarting Automata

✍ Scribed by Tomasz Jurdziński; Friedrich Otto; František Mráz; Martin Plátek


Publisher
Springer
Year
2007
Tongue
English
Weight
574 KB
Volume
42
Category
Article
ISSN
1433-0490

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


On the Computational Complexity of Finit
✍ 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