✦ LIBER ✦

Descriptional complexity of bounded context-free languages

✍ Scribed by Malcher, Andreas; Pighizzini, Giovanni

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Descriptional complexity of context-free

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

Structural complexity of context-free la

✍ K. Kobayashi 📂 Article 📅 1971 🏛 Elsevier Science ⚖ 520 KB

Context-free complexity of finite langua

✍ W. Bucher; H.A. Maurer; K. Culik II 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 1003 KB

Concatenation of Regular Languages and D

✍ Galina Jirásková 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 573 KB

A Note on Tape-Bounded Complexity Classe

✍ Sudborough, I. H. 📂 Article 📅 1975 🏛 Association for Computing Machinery 🌐 English ⚖ 133 KB

The error-bounded descriptional complexi

✍ Rüdiger W. Brause 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 944 KB