{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T01:31:47Z","timestamp":1648949507141},"reference-count":6,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1999,6,1]],"date-time":"1999-06-01T00:00:00Z","timestamp":928195200000},"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":5160,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1999,6]]},"DOI":"10.1016\/s0166-218x(99)00057-8","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T17:35:45Z","timestamp":1027618545000},"page":"205-209","source":"Crossref","is-referenced-by-count":2,"title":["On the regularity of languages generated by context-free evolutionary grammars"],"prefix":"10.1016","volume":"92","author":[{"given":"J\u00fcrgen","family":"Dassow","sequence":"first","affiliation":[]},{"given":"Gheorghe","family":"P\u01ceun","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(99)00057-8_BIB1","doi-asserted-by":"crossref","unstructured":"J. Dassow, V. Mitrana, Evolutionary grammars: a grammatical model for genome evolution, in: R. Hofest\u00e4dt et al. (Eds.), Bioinformatics, Proceedings of the German Conference on Bioinformatics, Lecture Notes in Computer Science 1278, Springer, Berlin, 1997, pp. 199\u2013209.","DOI":"10.1007\/BFb0033218"},{"key":"10.1016\/S0166-218X(99)00057-8_BIB2","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/S0303-2647(97)00036-1","article-title":"Context-free evolutionary grammars and the structural language of nucleic acids","volume":"43","author":"Dassow","year":"1997","journal-title":"BioSystems"},{"key":"10.1016\/S0166-218X(99)00057-8_BIB3","doi-asserted-by":"crossref","first-page":"1043","DOI":"10.1090\/S0002-9939-1966-0201310-3","article-title":"Bounded regular sets","volume":"17","author":"Ginsburg","year":"1966","journal-title":"Proc. Amer. Math. Soc."},{"key":"10.1016\/S0166-218X(99)00057-8_BIB4","unstructured":"J.E. Hopcroft, J.D. Ullman, Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, Reading, MA, 1979."},{"key":"10.1016\/S0166-218X(99)00057-8_BIB5","unstructured":"A. Salomaa, Jewels of Formal Languages, Computer Science Press, Rockville, 1981."},{"key":"10.1016\/S0166-218X(99)00057-8_BIB6","first-page":"1","article-title":"Uber unendliche Zeitchenreihen","volume":"7","author":"Thue","year":"1906","journal-title":"Norske Vid. Selsk. Skr. I. Mat. Nat. Kl. Christiania"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X99000578?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X99000578?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,14]],"date-time":"2020-01-14T16:46:54Z","timestamp":1579020414000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X99000578"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,6]]},"references-count":6,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1999,6]]}},"alternative-id":["S0166218X99000578"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(99)00057-8","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1999,6]]}}}