✦ LIBER ✦

DP lower bounds for equivalence-checking and model-checking of one-counter automata

✍ Scribed by Petr Jančar; Antonı́n Kučera; Faron Moller; Zdeněk Sawa

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Kleene theorem and model checking algo

✍ Blaise Genest; Dietrich Kuske; Anca Muscholl 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 370 KB

On an equivalence checking technique for

✍ R. I. Podlovchenko 📂 Article 📅 2011 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 233 KB

An Improved Bound on the Length of Check

✍ Holborow, C. E. 📂 Article 📅 1972 🏛 IEEE 🌐 English ⚖ 458 KB

On the equivalence of the max-min transp

✍ Yunpeng Pan; Leyuan Shi 📂 Article 📅 2006 🏛 Springer-Verlag 🌐 English ⚖ 220 KB

[Lecture Notes in Computer Science] Form

✍ Katoen, Joost-Pieter 📂 Article 📅 1999 🏛 Springer Berlin Heidelberg ⚖ 272 KB

On the Bounds for State-Set Size in the

✍ Moore, F.R. 📂 Article 📅 1971 🏛 IEEE 🌐 English ⚖ 949 KB