𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Context-free grammars with selective rewriting

✍ Scribed by G. Rozenberg; D. Wood

Publisher
Springer-Verlag
Year
1980
Tongue
English
Weight
613 KB
Volume
13
Category
Article
ISSN
0001-5903

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

Cooperation in context-free grammars
Cooperation in context-free grammars
✍ JΓΌrgen Dassow; Victor Mitrana πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 527 KB

A new dynamical measure of the descriptional complexity for context-free grammars and languages, namely the degree of cooperation, is introduced and studied. This measure is connected with respect to both families of languages considered, namely the regular and context-free languages. We prove that