✦ LIBER ✦

Reductive grammars with context control

✍ Scribed by M. G. Gontsa

Publisher: Springer US
Year: 1978
Tongue: English
Weight: 704 KB
Volume: 14
Category: Article
ISSN: 1573-8337
DOI: 10.1007/bf01069347

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Direction-independent grammars with cont

Direction-independent grammars with contexts

✍ Kunio Aizawa; Akira Nakamura 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 797 KB

Context-free grammars with selective rew

Context-free grammars with selective rewriting

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

On grammar forms with terminal context

✍ H. A. Maurer; D. Wood 📂 Article 📅 1976 🏛 Springer-Verlag 🌐 English ⚖ 305 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

Size, index, and context-sensitivity of

Size, index, and context-sensitivity of controlled partition grammars

✍ Eva-Maria Mückstein Wotschke; Detlef Wotschke; Peter J. Downey 📂 Article 📅 1977 🏛 Springer 🌐 English ⚖ 957 KB

A simultaneous reduction of several meas

A simultaneous reduction of several measures of descriptional complexity in scattered context grammars

✍ H. Fernau; A. Meduna 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 92 KB

In this paper, we prove that every recursively enumerable language can be generated by a scattered context grammar with a reduced number of both nonterminals and context-sensing productions.