✦ LIBER ✦

Context-free grammars with cancellation properties

✍ Scribed by Christiane Frougny

Book ID: 107948538
Publisher: Elsevier Science
Year: 1985
Tongue: English
Weight: 605 KB
Volume: 39
Category: Article
ISSN: 0304-3975
DOI: 10.1016/0304-3975(85)90127-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Generalized context-free grammars and mu

Generalized context-free grammars and multiple context-free grammars

✍ Tadao Kasami; Hiroyuki Seki; Mamoru Fujii 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 808 KB

Context-free grammars with selective rew

Context-free grammars with selective rewriting

✍ G. Rozenberg; D. Wood 📂 Article 📅 1980 🏛 Springer-Verlag 🌐 English ⚖ 613 KB

Modular Context-Free Grammars

✍ Shuly Wintner 📂 Article 📅 2002 🏛 Springer 🌐 English ⚖ 378 KB

Non-context-free grammars generating con

Non-context-free grammars generating context-free languages

✍ Brenda S. Baker 📂 Article 📅 1974 🏛 Elsevier Science ⚖ 760 KB

Context-free hypergraph grammars with no

Context-free hypergraph grammars with node rewriting

✍ Renate Klempien-Hinrichs 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 294 KB

Simulating finite automata with context-

Simulating finite automata with context-free grammars

✍ Michael Domaratzki; Giovanni Pighizzini; Jeffrey Shallit 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 78 KB

We consider simulating finite automata (both deterministic and nondeterministic) with context-free grammars in Chomsky normal form (CNF). We show that any unary DFA with n states can be simulated by a CNF grammar with O(n 1/3 ) variables, and this bound is tight. We show that any unary NFA with n st