✦ LIBER ✦

Language equivalence of probabilistic pushdown automata

✍ Scribed by Forejt, Vojtěch; Jančar, Petr; Kiefer, Stefan; Worrell, James

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On probabilistic pushdown automata

✍ Juraj Hromkovič; Georg Schnitger 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 230 KB

Probabilistic Length-Reducing Two-Pushdo

✍ Tomasz Jurdziński 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 800 KB

Branching-time model-checking of probabi

✍ Brázdil, Tomáš; Brožek, Václav; Forejt, Vojtěch; Kučera, Antonín 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 388 KB

The decidability of equivalence for dete

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

Yield-languages of two-way pushdown tree

✍ Kai Salomaa 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 476 KB

The equivalence problem for deterministi

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