✦ LIBER ✦

On the relation between the class of all context-free languages and the class of deterministic context-free languages

✍ Scribed by A. Ya. Dikovskii

Publisher: Springer US
Year: 1969
Tongue: English
Weight: 777 KB
Volume: 8
Category: Article
ISSN: 0002-5232
DOI: 10.1007/bf02219820

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Dm-automata and classes of context-free

Dm-automata and classes of context-free languages

✍ A. B. Stavrovskii; O. Yu. Pavliv 📂 Article 📅 1993 🏛 Springer US 🌐 English ⚖ 520 KB

The syntactic analysis of context-free l

The syntactic analysis of context-free languages

✍ V. N. Red'ko 📂 Article 📅 1968 🏛 Springer US 🌐 English ⚖ 821 KB

On the parallel recognition of unambiguo

On the parallel recognition of unambiguous context-free languages

✍ Michal Chytil; Maxime Crochemore; Burkhard Monien; Wojciech Rytter 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 716 KB

On the context-free production complexit

On the context-free production complexity of finite languages

✍ Zsolt Tuza 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 696 KB

The following problem is investigated. Let L be a given finite language, LcL,= {ub: I ~o,bsn, of/~}. Determine the minimal natural number c(L) such that L can be generated by c(L) context-free productions. Among others, max c(L) = O(n'/log n) is proved, and languages satisfying c(L) = IL) are charac

Classes of regular and context-free lang

Classes of regular and context-free languages over countably infinite alphabets

✍ Friedrich Otto 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 747 KB

The Boolean closure of linear context-fr

The Boolean closure of linear context-free languages

✍ Martin Kutrib; Andreas Malcher; Detlef Wotschke 📂 Article 📅 2008 🏛 Springer-Verlag 🌐 English ⚖ 321 KB