✦ LIBER ✦

Polynomial Algorithms for Deterministic Pushdown Automata

✍ Scribed by Rosenkrantz, Daniel J.; Hunt III, Harry B.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Two decidability results for determinist

✍ Matti Linna 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 1013 KB

A real-time strictness test for determin

✍ Michio Oyamaguchi; Yasuyoshi Inagaki; Namio Honda 📂 Article 📅 1980 🏛 Elsevier Science ⚖ 448 KB

The equivalence problem for deterministi

✍ Leslie G. Valiant 📂 Article 📅 1974 🏛 Elsevier Science ⚖ 500 KB

The decidability of equivalence for dete

✍ Michio Oyamaguchi; Namio Honda 📂 Article 📅 1978 🏛 Elsevier Science ⚖ 529 KB

Equivalence problem for real-time strict

✍ V. Yu. Romanovskii 📂 Article 📅 1980 🏛 Springer US 🌐 English ⚖ 867 KB

Deterministic pushdown-CD-systems of sta

✍ Benedek Nagy, Friedrich Otto 📂 Article 📅 2013 🏛 Springer-Verlag 🌐 English ⚖ 361 KB