✦ LIBER ✦

Simplification of context-free grammar through Petri net

✍ Scribed by A.A. Khan; M. Al-A'ali; N. Al-Shamlan

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Simplification of Boolean functions thro

✍ G.S. Hura 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 254 KB

Completeness of context-free grammar for

✍ H.A. Maurer; A. Salomaa; D. Wood 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 600 KB

Petri net algorithms in the theory of ma

✍ Dirk Hauschildt; Matthias Jantzen 📂 Article 📅 1994 🏛 Springer-Verlag 🌐 English ⚖ 560 KB

Consistency of stochastic context-free g

✍ Roland Gecse; Attila Kovács 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 405 KB

Inferability of context-free programmed

✍ H. R. Lu; K. S. Fu 📂 Article 📅 1984 🏛 Springer 🌐 English ⚖ 987 KB

Descriptional complexity of context-free

✍ Erzsébet Csuhaj-Varjú; Alica Kelemenová 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 818 KB