Complete symmetry in d2l systems and cellular automata

References

• Van Dalen , D. 1971 . A note on some systems of Lindenmayer . Math. Systems Theory , 5 : 128 – 140 .
   Google Scholar
• Elgot , C. C. and Mezei , J. E. 1965 . On relations defined by generalized finite automata . IBM J. Res. Develop , 9 : 47 – 65 .
   Web of Science ®Google Scholar
• Engelfriet , J. and Rozenberg , G. 1980 . Fixed point languages, equality languages, and representation of recursively enumerable languages . J. Assoc. Comput. Mach , 27 : 499 – 518 .
   Web of Science ®Google Scholar
• Ginsburg , S. 1975 . Algebraic and Automata-Theoretic Properties of Formal Languages , Amsterdam : North-Holland .
   Google Scholar
• Ginsburg , S. and Rose , G. F. 1970 . On the existence of generators of certain AFL . Inform. Sci. , 2 : 431 – 446 .
   Google Scholar
• Herman , G. T. 1969 . The computing ability of a developmental model for filamentous organisms . J. Theor. Biology , 25 : 421 – 435 .
   PubMed Web of Science ®Google Scholar
• Herman , G. T. 1971 . Models for cellular interactions in development without polarity of individual cells. Part I-General description and the problem of universal computing ability . Internat. J. Systems Sci. , 2 : 271 – 289 .
   Web of Science ®Google Scholar
• Herman , G. T. 1972 . Models for cellular interactions in development without polarity of individual cells. Part II—Problems of synchronization and regulation . Internat. J. Systems Sci. , 3 : 149 – 175 .
   Google Scholar
• Herman , G. T. and Rozenberg , G. 1975 . Developmental Systems and Languages , Amsterdam : North-Holland .
   Google Scholar
• Hopcroft , J. E. and Ullman , J. D. 1979 . Introduction to Automata Theory, Languages, and Computation , Reading, Mass : Addison-Wesley .
   Google Scholar
• Révész , G. E. 1983 . Introduction to Formal Languages , New York : Mc Graw-Hill .
   Google Scholar
• Rosenfeld , A. 1979 . Picture Languages: Formal Models for Picture Recognition , New York : Academic Press .
   Google Scholar
• Rozenberg , G. and Salomaa , A. 1980 . The Mathematical Theory of L Systems , New York : Academic Press .
   Google Scholar
• Ruohonen , K. 1976 . “ A symmetric D2L model for string regeneration ” . In Automata, Languages, and Development , Edited by: Lindenmayer , A. and Rozenberg , G. 263 – 270 . Amsterdam : North-Holland .
   Google Scholar
• Salomaa , A. 1973 . Formal Languages , New York : Academic Press .
   Google Scholar
• Smith , A. R. III . 1971 . Simple computation-universal cellular spaces . J. Assoc. Comput. Mach. , 18 : 339 – 353 .
   Web of Science ®Google Scholar
• Salomaa , A. 1982 . Formal Languages , New York : Academic Press .
   Google Scholar
• Vitányi , P. M. B. 1976 . Deterministic Lindenmayer languages, nonterminals and homomorphisms . Theor. Comp. Sci. , 2 : 49 – 71 .
   Google Scholar
• Wegbreit , B. 1969 . A generator of context-sensitive languages . J. Comput. System Sci. , 3 : 456 – 461 .
   Google Scholar