✦ LIBER ✦

Context-free hypergraph grammars with node rewriting

✍ Scribed by Renate Klempien-Hinrichs

Book ID: 108498241
Publisher: Elsevier Science
Year: 2002
Tongue: English
Weight: 294 KB
Volume: 51
Category: Article
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(04)80203-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Logic hypergraph grammars and context-fr

Logic hypergraph grammars and context-free hypergraph grammars

✍ Isamu Shioya; Katsuhiko Nakamura 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 711 KB

Context-free grammars with selective rew

Context-free grammars with selective rewriting

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

The Generative Power of Context-free Nod

The Generative Power of Context-free Node Rewriting in Hypergraphs

✍ Renate Klempien-Hinrichs 📂 Article 📅 1999 🏛 Springer 🌐 English ⚖ 104 KB

Context-free grammars with cancellation

Context-free grammars with cancellation properties

✍ Christiane Frougny 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 605 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

Self-embedded context-free grammars with

Self-embedded context-free grammars with regular counterparts

✍ Stefan Andrei; Wei-Ngan Chin; SalvadorValerio Cavadini 📂 Article 📅 2004 🏛 Springer-Verlag 🌐 English ⚖ 191 KB