Concentration dependent OL systems

References

• Berstel , J. and Nielsen , M. 1976 . “ The growth range equivalence problem for DOL systems is decidable ” . In in Automata, Languages, Development , Edited by: Rozenberg , G. and Lindenmayer , A. 161 – 178 . North-Holland .
   Google Scholar
• Culik , K. II and Fris , I. 1977 . The sequence equivalence for DOL systems is decidable . in Proc. IV Coll Automata, Languages and Programming, Lecture Notes in Computer Science , 52 : 148 – 163 .
   Google Scholar
• Culik , K. II and Opatrny , J. 1974 . “ Context in parallel rewriting ” . In L systems , Edited by: Salomaa , A. and Rozenberg , G. Vol. 15 , 230 – 243 . Lecture Notes in Computer Science .
   Google Scholar
• Ginsburg , S. and Rovan , B. 1974 . On the periodicity of word-length in DOL languages . Information and Control , 26 : 34 – 44 .
   Google Scholar
• Herman , G.T. and Rozenberg , G. 1975 . Developmental systems and languages , North-Holland .
   Google Scholar
• Lee , K.P. and Rozenberg , G. 1974 . The length sets of DOL languages are uniformly bounded . Inform. Proc. Letters , 2 : 185 – 188 .
   Google Scholar
• Nielsen , M. 1974 . On the decidability of some equivalence problems for DOL systems . Information and Control , 25 : 166 – 193 .
   Google Scholar
• Nielsen , M. , Rozenberg , G. , Salomaa , A. and Skyum , S. 1974 . Nonterminals, homomorphisms and coding in different variations of OL systems I and II . Acta Informatica , 3 : 357 – 364 . 4, 1974, 87-106
   Google Scholar
• Reusch , P.J.A. 1974 . “ Regulierte TOL-Systeme I ” . In Bericht Nr. 81, Gesellsch. für Math, und Datenverarbeitung , Bonn .
   Google Scholar
• Rozenberg , G.T. 1972 . The equivalence problem for deterministic T0L systems is undecid-able . Inform. Proc. Letters , 1 : 201 – 204 . Errata 252
   Google Scholar
• Rozenberg , G.T. and Rozenberg , G. 1974 . DOL sequences . Discr. Math , 7 : 323 – 347 .
   Google Scholar
• Rozenberg , G. and Lee , K.P. 1975 . Some properties of the class of L languages with interactions . Journal of Computer and System Sciences , 11 : 129 – 147 .
   Google Scholar
• Rozenberg , G. and Vermeier , D. . Context free programmed grammars and ETOL systems . Proc. Symp. Math. Found. Comp. Sc . Vol. 45 , pp. 482 – 487 . Lecture Notes in Computer Science .
   Google Scholar
• Rozenberg , G. and Von Solms , S.H. 1977 . Priorities on context conditions in rewriting systems , University of Antwerp . Techn. report No. 77-15
   Google Scholar
• Ruohonen , K. 1975 . On the synthesis of DOL growth . Ann. Acad. Sc. Fennicae A I. Math , 1 : 143 – 154 .
   Google Scholar
• Salomaa , A. 1975 . On exponential growth in Lindenmayer systems . Indagationes Math , 35 : 23 – 30 .
   Google Scholar
• Salomaa , A. 1975 . “ Growth functions in Lindenmayer systems:some new approaches ” . In Automata, Languages, Development , Edited by: Rozenberg , G. and Lindenmayer , A. 271 – 281 . North-Holland .
   Google Scholar
• Salomaa , A. . Comparative decision problems between sequential and parallel rewriting . Proc. Symp . pp. 62 – 66 . Tokyo : Uniformly Stretched Automata .
   Google Scholar
• Soittola , M. 1975 . “ On DOL synthesis problem ” . In Asutomata, Languages, Development , 313 – 321 . North-Holland .
   Google Scholar
• Vitanyi , P.M.B. 1973 . Structure of growth in Lindenmayer systems . Indagationes Math , 35 : 247 – 253 .
   Google Scholar
• Vitanyi , P.M.B. 1974 . “ Growth of strings in context dependent Lindenmayer systems ” . In Lecture Notes in Computer Science Edited by: Salomaa , A. and Rozenberg , G. Vol. 15 , 104 – 127 . in Lsystems
   Google Scholar
• Vitanyi , P.M.B. 1974 . “ On the size of DOL languages ” . In Lecture Notes in Computer Science Edited by: Salomaa , A. and Rozenberg , G. Vol. 15 , 78 – 92 . in L systems
   Google Scholar
• Von Solms , S.H. 1975 . Some notes on ETOL languages . J. Comp. Math , 5 : 285 – 296 .
   Web of Science ®Google Scholar