✦ LIBER ✦

On the computational complexity of bisimulation, redux

✍ Scribed by Faron Moller; Scott Smolka; Jiří Srba

Book ID: 113641533
Publisher: Elsevier Science
Year: 2004
Tongue: English
Weight: 233 KB
Volume: 194
Category: Article
ISSN: 0890-5401
DOI: 10.1016/j.ic.2004.06.003

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 infin

On the computational complexity of infinite words

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

On the computational complexity of graph

On the computational complexity of graph closures

✍ Angelo Monti 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 375 KB

On the computational complexity of the o

On the computational complexity of the order polynomial

✍ Ulrich Faigle; Rainer Schrader 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 370 KB

On the computational complexity of the R

On the computational complexity of the Riemann mapping

✍ Ilia Binder; Mark Braverman; Michael Yampolsky 📂 Article 📅 2007 🏛 Springer Netherlands 🌐 English ⚖ 275 KB

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