{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T01:46:00Z","timestamp":1649123160941},"reference-count":16,"publisher":"Elsevier BV","issue":"5-6","license":[{"start":{"date-parts":[[1993,5,1]],"date-time":"1993-05-01T00:00:00Z","timestamp":736214400000},"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":7382,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Symbolic Computation"],"published-print":{"date-parts":[[1993,5]]},"DOI":"10.1016\/s0747-7171(06)80013-1","type":"journal-article","created":{"date-parts":[[2007,4,25]],"date-time":"2007-04-25T14:20:47Z","timestamp":1177510847000},"page":"807-842","source":"Crossref","is-referenced-by-count":4,"title":["Synthesis of real time acceptors"],"prefix":"10.1016","volume":"15","author":[{"given":"Amr F.","family":"Fahmy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alan W.","family":"Biermann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0747-7171(06)80013-1_bib1","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0890-5401(87)90052-6","article-title":"Learning regular sets from queries and counter examples","volume":"75","author":"Angluin","year":"1987","journal-title":"Information and Computation"},{"key":"10.1016\/S0747-7171(06)80013-1_bib2","doi-asserted-by":"crossref","DOI":"10.1007\/BF00116034","article-title":"Negative results for equivalence queries","author":"Angluin","year":"1988"},{"key":"10.1016\/S0747-7171(06)80013-1_bib3","series-title":"Proceedings of the Second Annual Workshop on Computational Learning Theory","first-page":"134","article-title":"Equivalence queries and approximate fingerprints","author":"Angluin","year":"1989"},{"key":"10.1016\/S0747-7171(06)80013-1_bib4","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1145\/356914.356918","article-title":"Inductive inference: Theory and Methods","volume":"15","author":"Angluin","year":"1983","journal-title":"Computing Surveys"},{"key":"10.1016\/S0747-7171(06)80013-1_bib5","series-title":"Proceedings of the 28th IEEE Symposium on Foundations of Computer Science","first-page":"61","article-title":"Learning one-counter languages in polynomial time","author":"Berman","year":"1987"},{"key":"10.1016\/S0747-7171(06)80013-1_bib6","article-title":"A fundamental theorem for real time programs","author":"Biermann","year":"1977"},{"key":"10.1016\/S0747-7171(06)80013-1_bib7","series-title":"Sequential Machines and Automata Theory","author":"Booth","year":"1968"},{"key":"10.1016\/S0747-7171(06)80013-1_bib8","article-title":"Synthesis of Real Time Programs","author":"Fahmy","year":"1989","journal-title":"PhD thesis, Duke University"},{"key":"10.1016\/S0747-7171(06)80013-1_bib9","series-title":"Proceedings of the 1988 Annual Workshop on Computational Learning Theory","first-page":"227","article-title":"Learning via queries","author":"Gasarch","year":"1988"},{"key":"10.1016\/S0747-7171(06)80013-1_bib10","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1016\/S0019-9958(67)91165-5","article-title":"Language identification in the limit","volume":"10","author":"Gold","year":"1967","journal-title":"Information and Control"},{"key":"10.1016\/S0747-7171(06)80013-1_bib11","series-title":"Algebraic Structure Theory of Sequential Machines","author":"Hartmanis","year":"1966"},{"key":"10.1016\/S0747-7171(06)80013-1_bib12","series-title":"Proceedings of the Second Annual Workshop on Computational Learning Theory","first-page":"162","article-title":"Learning simple deterministic languages","author":"Ishizaka","year":"1989"},{"key":"10.1016\/S0747-7171(06)80013-1_bib13","series-title":"Introduction To Automata Theory, Languages, And Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/S0747-7171(06)80013-1_bib14","series-title":"Elements Of The Theory Of Computation","author":"Lewis","year":"1981"},{"key":"10.1016\/S0747-7171(06)80013-1_bib15","series-title":"Proceedings of the 1988 annual Workshop on Computational Learning Theory","first-page":"330","article-title":"Learning Context-Free Grammars from structural data in polynomial time","author":"Sakakibara","year":"1988"},{"key":"10.1016\/S0747-7171(06)80013-1_bib16","doi-asserted-by":"crossref","DOI":"10.1109\/TEC.1962.5219459","article-title":"Real-time computation and recursive functions not real-time computable","author":"Yamada","year":"1962","journal-title":"IRE Trans. Electronic Comp."}],"container-title":["Journal of Symbolic Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0747717106800131?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0747717106800131?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,7]],"date-time":"2019-01-07T19:53:13Z","timestamp":1546890793000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0747717106800131"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,5]]},"references-count":16,"journal-issue":{"issue":"5-6","published-print":{"date-parts":[[1993,5]]}},"alternative-id":["S0747717106800131"],"URL":"https:\/\/doi.org\/10.1016\/s0747-7171(06)80013-1","relation":{},"ISSN":["0747-7171"],"issn-type":[{"value":"0747-7171","type":"print"}],"subject":[],"published":{"date-parts":[[1993,5]]}}}