{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T18:39:48Z","timestamp":1767897588196,"version":"3.49.0"},"reference-count":17,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1980,6,1]],"date-time":"1980-06-01T00:00:00Z","timestamp":328665600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,18]],"date-time":"2013-07-18T00:00:00Z","timestamp":1374105600000},"content-version":"vor","delay-in-days":12100,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Control"],"published-print":{"date-parts":[[1980,6]]},"DOI":"10.1016\/s0019-9958(80)90637-3","type":"journal-article","created":{"date-parts":[[2004,12,15]],"date-time":"2004-12-15T09:12:12Z","timestamp":1103101932000},"page":"251-262","source":"Crossref","is-referenced-by-count":6,"title":["Hypercodes in deterministic and slender 0L languages"],"prefix":"10.1016","volume":"45","author":[{"given":"Tom","family":"Head","sequence":"first","affiliation":[]},{"given":"G.","family":"Thierrin","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0019-9958(80)90637-3_bib1","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1016\/S0019-9958(74)90705-0","article-title":"On the periodicity of wordlength in D0L languages","volume":"26","author":"Ginsburg","year":"1974","journal-title":"Inform. Contr."},{"key":"10.1016\/S0019-9958(80)90637-3_bib2","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1016\/S0021-9800(69)80111-0","article-title":"On free monoids partially ordered by embedding","volume":"6","author":"Haines","year":"1969","journal-title":"J. Combinatorial Theory"},{"key":"10.1016\/S0019-9958(80)90637-3_bib3","series-title":"Introduction to Formal Language Theory","author":"Harrison","year":"1978"},{"key":"10.1016\/S0019-9958(80)90637-3_bib4","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/S0019-9958(74)80051-3","article-title":"Closure properties of some families of languages associated with biological systems","volume":"24","author":"Herman","year":"1974","journal-title":"Inform. Contr."},{"key":"10.1016\/S0019-9958(80)90637-3_bib5","series-title":"Developmental Systems and Languages","author":"Herman","year":"1975"},{"key":"10.1016\/S0019-9958(80)90637-3_bib6","first-page":"326","article-title":"Ordering by divisibility in abstract algebras","volume":"2","author":"Higman","year":"1952"},{"key":"10.1016\/S0019-9958(80)90637-3_bib7","first-page":"651","article-title":"Sur un th\u00e9or\u00e8me d'extension dans la th\u00e9orie des mots","volume":"266","author":"Jullien","year":"1968","journal-title":"C. R. Acad. Sci. Paris, Ser. A"},{"key":"10.1016\/S0019-9958(80)90637-3_bib8","first-page":"185","article-title":"The length sets of D0L languages are uniformly bounded","volume":"2","author":"Lee","year":"1974"},{"key":"10.1016\/S0019-9958(80)90637-3_bib9","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, II","volume":"18","author":"Lindenmayer","year":"1968","journal-title":"J. Theoret. Biol."},{"key":"10.1016\/S0019-9958(80)90637-3_bib10","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1016\/0022-5193(71)90002-6","article-title":"Developmental system without cellular interaction, their languages and grammar","volume":"30","author":"Lindenmayer","year":"1971","journal-title":"J. Theoret. Biol."},{"key":"10.1016\/S0019-9958(80)90637-3_bib11","series-title":"Automata, Languages, Development","year":"1976"},{"key":"10.1016\/S0019-9958(80)90637-3_bib12","series-title":"L Systems","year":"1974"},{"key":"10.1016\/S0019-9958(80)90637-3_bib13","first-page":"207","article-title":"A note on equal powers of word morphisms","volume":"11","author":"Ruononen","year":"1977","journal-title":"R.A.I.R.O. Informatique th\u00e9orique\/Theoret. Comput. Sci."},{"key":"10.1016\/S0019-9958(80)90637-3_bib14","series-title":"Formal Languages","author":"Salomaa","year":"1973"},{"key":"10.1016\/S0019-9958(80)90637-3_bib15","series-title":"Free Monoids and Languages","author":"Shyr","year":"1979"},{"key":"10.1016\/S0019-9958(80)90637-3_bib16","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/S0019-9958(74)80022-7","article-title":"Hypercodes","volume":"24","author":"Shyr","year":"1974","journal-title":"Inform. Contr."},{"key":"10.1016\/S0019-9958(80)90637-3_bib17","series-title":"L Systems","article-title":"On the size of D0L languages","author":"Vit\u00e0nyi","year":"1974"}],"container-title":["Information and Control"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995880906373?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995880906373?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,31]],"date-time":"2019-01-31T13:53:34Z","timestamp":1548942814000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0019995880906373"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1980,6]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1980,6]]}},"alternative-id":["S0019995880906373"],"URL":"https:\/\/doi.org\/10.1016\/s0019-9958(80)90637-3","relation":{},"ISSN":["0019-9958"],"issn-type":[{"value":"0019-9958","type":"print"}],"subject":[],"published":{"date-parts":[[1980,6]]}}}