𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the computational complexity of infinite words

✍ Scribed by Pavol Ďuriš; Ján Maňuch

Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
132 KB
Volume
295
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On computational complexity of contextua
On computational complexity of contextual languages
✍ Lucian Ilie 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 726 KB

We consider the following restriction of internal contextual grammars, called local: in any derivation in a grammar, after applying a context, further contexts can be added only inside of or at most adjacent to the previous ones. We further consider a natural restriction of this derivation mode by r

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