✦ LIBER ✦

The logic-termal equivalence is polynomial-time decidable

✍ Scribed by V.K. Sabelfeld

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Tree equivalence of linear recursive sch

✍ V.K. Sabelfeld 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 856 KB

Equivalence of linear, free, liberal, st

✍ Sebastian Danicic; Mark Harman; Rob Hierons; John Howroyd; Michael R. Laurence 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 379 KB

Probabilistic weak simulation is decidab

✍ Christel Baier; Holger Hermanns; Joost-Pieter Katoen 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 232 KB

Equivalence in Finite-Variable Logics is

✍ Martin Grohe 📂 Article 📅 1999 🏛 Springer-Verlag 🌐 English ⚖ 392 KB

The equivalence of pre-NTS grammars is d

✍ J. -M. Autebert; L. Boasson 📂 Article 📅 1992 🏛 Springer 🌐 English ⚖ 743 KB

Equivalence of free boolean graphs can b

✍ Manuel Blum; Ashok K. Chandra; Mark N. Wegman 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 367 KB