Abstract
The notion of a KOL system, that is a deterministic tabled OL system where the use of the tables is regulated by the concentration of the letters in a word, is introduced. The relationship of KOL languages and KOL growth functions with languages and growth functions of other L systems is studied. The effect of the use of homomorphisms and nonterminals to the generative power is investigated. Some decision problems are shown to be decidable for a special type of KOL languages.