Abstract
The use of nonterminals versus the use of codings in variations of OL-systems is studied. It is shown that the use of nonterminals produces a comparatively low generative capacity in deterministic systems while it produces a comparatively high generative capacity in nondeterministic systems.
Finally it is proved that the family of context-free languages is contained in the family generated by codings on propagating OL-systems with a finite set of axioms, which was one of the open problems in [10]. All the results in this paper can be found in [71] and [72].
Finally it is proved that the family of context-free languages is contained in the family generated by codings on propagating OL-systems with a finite set of axioms, which was one of the open problems in [10]. All the results in this paper can be found in [71] and [72].
| Original language | English |
|---|---|
| Title of host publication | L Systems |
| Editors | Grzegorz Rozenberg, Arto Salomaa |
| Number of pages | 6 |
| Publisher | Springer |
| Publication date | 1974 |
| Pages | 244-249 |
| DOIs | |
| Publication status | Published - 1974 |
| Series | Lecture Notes in Computer Science |
|---|---|
| Volume | 15 |