|
| next >> |
Journal description
All volumes of the corresponding journal
All issues of the corresponding volume
All articles of the corresponding issues
Details for article 1 of 12 found articles
| Title: |
Active Symbols in Pure Systems |
| Author: |
Bensch, Suna Bordihn, Henning |
| Appeared in: |
Fundamenta informaticae |
| Paging: | Volume 76 (2007) nr. 3 pages 239-254 |
| Year: |
2007-03-15 |
| Contents: |
In this paper, we consider the number of (statically measured) active symbols for Lindenmayer systems without interaction and some variants thereof as well as for pure CD grammar systems, where no distinction between terminal and nonterminal symbols is made. This measure of descriptional complexity gives rise to infinite hierarchies in all cases considered here. Moreover, all the devices under consideration are compared with respect to their generative power when the number of active symbols is bounded. Finally, some closure and many non-closure properties of the corresponding language families with a fixed number of active symbols are proved. |
| Publisher: |
IOS Press |
| Source file: |
Elektronische Wetenschappelijke Tijdschriften |
Details for article 1 of 12 found articles
| next >> |