✦ LIBER ✦

A Quasi-polynomial-time Algorithm for Sampling Words from a Context-Free Language

✍ Scribed by Vivek Gore; Mark Jerrum; Sampath Kannan; Z. Sweedyk; Steve Mahaney

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A pumping lemma for real-time determinis

✍ Yoshihide Igarashi 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 569 KB

Context-free grammars as a tool for desc

✍ A.O. Slisenko 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 749 KB

A recognizing algorithm for a loop free

✍ Mitsuru Ikeda; Eiichi Tanaka 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 845 KB

A strongly polynomial algorithm for crit

✍ Esparza, Javier; Gaiser, Andreas; Kiefer, Stefan 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 167 KB

A note on computing time for the recogni

✍ Kenichi Taniguchi; Tadao Kasami 📂 Article 📅 1969 🏛 Elsevier Science ⚖ 280 KB

A polynomial time algorithm to decide pa

✍ Hsu-Chun Yen 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 677 KB