✦ LIBER ✦

The complexity of computing the behaviour of lattice automata on infinite trees

✍ Scribed by Lehmann, Karsten; Peñaloza, Rafael

Book ID: 122317164
Publisher: Elsevier Science
Year: 2014
Tongue: English
Weight: 386 KB
Volume: 534
Category: Article
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2014.02.036

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The complexity of tree automata and XPat

The complexity of tree automata and XPath on grammar-compressed trees

✍ Markus Lohrey; Sebastian Maneth 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 292 KB

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

Alternating automata, the weak monadic t

Alternating automata, the weak monadic theory of trees and its complexity

✍ David E. Muller; Ahmed Saoudi; Paul E. Schupp 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 882 KB

The complexity of computing best-respons

The complexity of computing best-response automata in repeated games

✍ Itzhak Gilboa 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 662 KB

On the computational complexity of infin

On the computational complexity of infinite words

✍ Pavol Ďuriš; Ján Maňuch 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 132 KB