{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,6,24]],"date-time":"2022-06-24T17:29:57Z","timestamp":1656091797624},"reference-count":21,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1976,6,1]],"date-time":"1976-06-01T00:00:00Z","timestamp":202435200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":13560,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1976,6]]},"DOI":"10.1016\/0304-3975(76)90006-2","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:17:21Z","timestamp":1027657041000},"page":"49-71","source":"Crossref","is-referenced-by-count":6,"title":["Deterministic Lindenmayer languages, nonterminals and homomorphisms"],"prefix":"10.1016","volume":"2","author":[{"given":"Paul M.B.","family":"Vit\u00e1nyi","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(76)90006-2_BIB1_1","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0020-7101(72)90014-1","article-title":"Simulation of organisms using a developmental model, I: Basic description","volume":"3","author":"Baker","year":"1972","journal-title":"Internl. J. Bio-Med. Comput."},{"key":"10.1016\/0304-3975(76)90006-2_BIB1_2","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/0020-7101(72)90030-X","article-title":"Simulation of organisms using a developmental model, II: The heterocyst formation problem in blue-green algae","volume":"3","author":"Baker","year":"1972","journal-title":"Internal. J. Bio-Med. Comput."},{"key":"10.1016\/0304-3975(76)90006-2_BIB2","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1016\/S0019-9958(67)90032-0","article-title":"An 8 state minimal solution to the firing squad synchronization problem","volume":"10","author":"Balzer","year":"1967","journal-title":"Information and Control"},{"key":"10.1016\/0304-3975(76)90006-2_BIB3","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1007\/BF01702868","article-title":"A note on some systems of Lindenmayer","volume":"5","author":"van Dalen","year":"1971","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0304-3975(76)90006-2_BIB4","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1080\/00207167408803083","article-title":"The equality of E0L languages and codings of 0L languages","volume":"4","author":"Ehrenfeucht","year":"1974","journal-title":"Internl. J. Comput. Math."},{"key":"10.1016\/0304-3975(76)90006-2_BIB5","series-title":"Automata, Languages and Programming","first-page":"473","article-title":"Trade off between the use of nonterminals, codings and homomorphisms in defining languages for some classes of rewriting systems","volume":"14","author":"Ehrenfeucht","year":"1974"},{"key":"10.1016\/0304-3975(76)90006-2_BIB6","series-title":"L Systems","first-page":"24","article-title":"A model for the growth and flowering of Aster-Angliae on the basis of table (0, 1)L systems","volume":"15","author":"Frijters","year":"1974"},{"key":"10.1016\/0304-3975(76)90006-2_BIB7","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1177\/003754977302100203","article-title":"The daughter of CELIA, the french flag and the firing squad","volume":"21","author":"Herman","year":"1973","journal-title":"Simulation"},{"key":"10.1016\/0304-3975(76)90006-2_BIB8","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/S0019-9958(74)90833-X","article-title":"Synchronization of growing cellular arrays","volume":"25","author":"Herman","year":"1974","journal-title":"Information and Control"},{"key":"10.1016\/0304-3975(76)90006-2_BIB9","series-title":"Developmental Systems and Languages","author":"Herman","year":"1975"},{"key":"10.1016\/0304-3975(76)90006-2_BIB10","series-title":"Tech. Rept. #75","article-title":"Simulation of organisms based on L systems","author":"Herman","year":"1974"},{"key":"10.1016\/0304-3975(76)90006-2_BIB11","series-title":"Formal Languages and Their Relation to Automata","author":"Hopcroft","year":"1969"},{"key":"10.1016\/0304-3975(76)90006-2_BIB12","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1016\/0022-5193(68)90079-9","article-title":"Mathematical models for cellular interactions in development I and II","volume":"18","author":"Lindenmayer","year":"1968","journal-title":"J. Theoret. Biol."},{"key":"10.1016\/0304-3975(76)90006-2_BIB13","series-title":"Computation: Finite and Infinite Machines","author":"Minsky","year":"1967"},{"key":"10.1016\/0304-3975(76)90006-2_BIB14","series-title":"Tech. Rept. PB-21","article-title":"Nonterminals, homomorphisms and codings in different variations of 0L systems","author":"Nielsen","year":"1974"},{"key":"10.1016\/0304-3975(76)90006-2_BIB15","doi-asserted-by":"crossref","first-page":"526","DOI":"10.1145\/321186.321195","article-title":"Words in the history of a Turing machine with fixed input","volume":"10","author":"Rabin","year":"1963","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(76)90006-2_BIB16","series-title":"Theory of Recursive Functions and Effective Computability","author":"Rogers","year":"1967"},{"key":"10.1016\/0304-3975(76)90006-2_BIB17","series-title":"Tech. Rept. #28","article-title":"L systems with interactions: the hierarchy","author":"Rozenberg","year":"1972"},{"key":"10.1016\/0304-3975(76)90006-2_BIB18","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/S0022-0000(75)80053-5","article-title":"Some properties of the class of L languages with interactions","volume":"11","author":"Rozenberg","year":"1975","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(76)90006-2_BIB19","series-title":"Formal Languages","author":"Salomaa","year":"1973"},{"key":"10.1016\/0304-3975(76)90006-2_BIB20","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1007\/BF00571462","article-title":"On sentential forms of context free grammars","volume":"2","author":"Salomaa","year":"1973","journal-title":"Acta Informatica"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397576900062?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397576900062?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T13:54:10Z","timestamp":1555077250000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397576900062"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1976,6]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1976,6]]}},"alternative-id":["0304397576900062"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(76)90006-2","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1976,6]]}}}