✦ LIBER ✦

Semantics of context-free languages: Correction

✍ Scribed by Donald E. Knuth

Publisher: Springer
Year: 1971
Tongue: English
Weight: 95 KB
Volume: 5
Category: Article
ISSN: 1433-0490
DOI: 10.1007/bf01702865

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Bracketed context-free languages

✍ Seymour Ginsburg; Michael A. Harrison 📂 Article 📅 1967 🏛 Elsevier Science 🌐 English ⚖ 1012 KB

A bracketed grammar is a context-free grammar in which indexed brackets are inserted around the right-hand sides of the rules. The language generated by a bracketed grammar is a bracketed language. An algebraic condition is given for one bracketed language to be a subset of another. The intersection

Approximately matching context-free lang

Approximately matching context-free languages

✍ Gene Myers 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 609 KB

On commutative context-free languages

✍ J. Beauquier; M. Blattner; M. Latteux 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 620 KB

On regularity of context-free languages

✍ A. Ehrenfeucht; D. Haussler; G. Rozenberg 📂 Article 📅 1983 🏛 Elsevier Science ⚖ 112 KB

A characterization of context-free langu

A characterization of context-free languages

✍ Jozef Gruska 📂 Article 📅 1971 🏛 Elsevier Science 🌐 English ⚖ 522 KB

Growth-sensitivity of context-free langu

Growth-sensitivity of context-free languages

✍ Tullio Ceccherini-Silberstein; Wolfgang Woess 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 265 KB

A language L over a ÿnite alphabet is called growth-sensitive if forbidding any set of subwords F yields a sub-language L F whose exponential growth rate is smaller than that of L. It is shown that every (essentially) ergodic non-linear context-free language of convergent type is growth-sensitive. "