Keyword: Active Symbol : Search

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.

Advanced Search

SEARCH GUIDE

Results: 1 - 1of1

Follow results:

per page:

Sort: Relevance

Context for search term 1Search term 1*

All Dates

LastSelect static range

Custom Range

Select starting monthSelect starting year

Select ending monthSelect ending year

Search name	Searched On	Run search
Keyword: Active Symbol (1)	26 Mar 2025	Run
Keyword: Branching Law (10)	26 Mar 2025	Run
Keyword: Momentum Maps (3)	26 Mar 2025	Run
Keyword: Orthogonality (15)	26 Mar 2025	Run
Keyword: Lower Bounded (1)	26 Mar 2025	Run

articleNo Access
ON THE NUMBER OF ACTIVE SYMBOLS IN LINDENMAYER SYSTEMS
- JÜRGEN DASSOW and
- GYÖRGY VASZIL
International Journal of Foundations of Computer Science01 Jan 2011
Preview Abstract
A symbol a is called active in an L system G if there is a rule a → υ with a ≠ υ in some table of G. By Ac_X(L) we denote the number of active symbols necessary to generate L by L systems of type X. For two types X and Y of L systems such that the corresponding languages families and satisfy , we say that Y is more efficient than X, if there is a sequence of languages , n ≥ 1, such that Ac_X(L_n) ≥ n and Ac_Y(L_n) ≤ k for some constant k. In this paper we shall show that the inclusion implies that Y is more efficient than X. Analogous results are presented for some modifications of the measure of active symbols.

1