Complexity of pattern generation by map-L systems
There are additional results which can be proved such as the following:
Theorem 7.2: For every m there is no such that for any n⩾no there is ko(m,n) such that c m n , c m n+k are incomparable but not disjoint for k⩾ko(m,n).
The symbol " → " stand for inclusion relation and strict inclusion or equality appear according to the theorems in this paper.
Unable to display preview. Download preview PDF.
- Carlyle, J.W., Greibach, S.A., Paz, A., "A Two-Dimensional Generating System Modelling Growth by Binary Cell Division", IEEE 15th Annual Symposium on Switching and Automata Theory, October 1974, 1–12.Google Scholar
- Mayoh, B.H., "Mathematical Models for Cellular Organisms", T.R. DAIMI PB-12, Datalogiok Afdeling, Aarhus Universitet, April 1973.Google Scholar
- Lindenmayer, A., "Mathematical Models for Cellular Interactions in Development", Part I, J. of Theoretical Biology, 1968, Vol.18, 280–299.Google Scholar
- [3a]Lindenmayer, A., "Mathematical Models for Cellular Interactions in Development", Part II, J. Of Theoretical Biology, 1968, Vol. 18, 300–315.Google Scholar
- G.T. Herman & G. Rozenberg, Developmental Systems and Languages. North — Holland Publishing Co., 1975.Google Scholar
- Rozenberg, G. and A. Salomaa (ed.) L Systems, Springer lecture notes in Computer Science, Vol. 15, 1974.Google Scholar
- A. Lindenmayer and G. Rozenberg (ed.) Automata, Languages, Development. North-Holland Publishing Co., 1976.Google Scholar
- Berge, C. The Theory of Graphs and its Applications. Methuen & Co., Ltd., London, 1962.Google Scholar