{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,5]],"date-time":"2024-07-05T17:37:39Z","timestamp":1720201059268},"reference-count":7,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1986,1,1]],"date-time":"1986-01-01T00:00:00Z","timestamp":504921600000},"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":10059,"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":[[1986]]},"DOI":"10.1016\/0304-3975(86)90029-0","type":"journal-article","created":{"date-parts":[[2003,4,25]],"date-time":"2003-04-25T06:09:04Z","timestamp":1051250944000},"page":"175-195","source":"Crossref","is-referenced-by-count":10,"special_numbering":"C","title":["Generalized regular expressions\u2014A language for synthesis of programs with branching in loops"],"prefix":"10.1016","volume":"46","author":[{"given":"A.","family":"Brazma","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E.","family":"Kinber","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(86)90029-0_BIB1","first-page":"333","article-title":"Some rules of inductive inference and their use for program synthesis","volume":"83","author":"Barzdin","year":"1983"},{"key":"10.1016\/0304-3975(86)90029-0_BIB2","unstructured":"A.N. Brazma, Inductive inference of programs containing while loops, Elektron. Informationsverarb. Kybernetik, to appear."},{"key":"10.1016\/0304-3975(86)90029-0_BIB3","first-page":"234","article-title":"On inductive synthesis of programs","volume":"122","author":"Barzdin","year":"1981"},{"issue":"6","key":"10.1016\/0304-3975(86)90029-0_BIB4","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1007\/BF00995500","article-title":"A class of functions synthesized from a finite number of examples and LISP program scheme","volume":"8","author":"Kadratoff","year":"1979","journal-title":"Internat. J. Comput. Inform. Sci."},{"issue":"2","key":"10.1016\/0304-3975(86)90029-0_BIB5","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1109\/TSE.1976.233812","article-title":"Constructing programs from example computations","volume":"SE-2","author":"Bierman","year":"1976","journal-title":"IEEE Trans. Software Enrg."},{"issue":"2","key":"10.1016\/0304-3975(86)90029-0_BIB6","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1145\/321992.322002","article-title":"A methodology for LISP program construction from examples","volume":"24","author":"Summers","year":"1977","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(86)90029-0_BIB7","series-title":"Finite Automata","author":"Trakhtenbrot","year":"1973"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397586900290?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397586900290?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T16:53:43Z","timestamp":1553187223000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397586900290"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986]]},"references-count":7,"alternative-id":["0304397586900290"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(86)90029-0","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1986]]}}}