{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T08:33:31Z","timestamp":1649147611873},"reference-count":5,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1988,9,1]],"date-time":"1988-09-01T00:00:00Z","timestamp":589075200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["BIT"],"published-print":{"date-parts":[[1988,9]]},"DOI":"10.1007\/bf01941135","type":"journal-article","created":{"date-parts":[[2005,7,31]],"date-time":"2005-07-31T10:23:42Z","timestamp":1122805422000},"page":"573-580","source":"Crossref","is-referenced-by-count":4,"title":["Inductive inference of ultimately periodic sequences"],"prefix":"10.1007","volume":"28","author":[{"given":"Peter","family":"Johansen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF01941135_CR1","doi-asserted-by":"crossref","first-page":"741","DOI":"10.1145\/322326.322334","volume":"29","author":"D. Angluin","year":"1982","unstructured":"D. Angluin,Inference of reversible languages, Journal of the Association for Computing Machinery, Vol. 29, 1982, pp. 741\u2013765.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"BF01941135_CR2","doi-asserted-by":"crossref","unstructured":"D. Angluin and C. H. Smith,Inductive inference: theory and methods, Computing Surveys, Vol. 15, No. 3, 1983.","DOI":"10.1145\/356914.356918"},{"key":"BF01941135_CR3","first-page":"9","volume":"2","author":"P. C. Bernick","year":"1987","unstructured":"P. C. Bernick and S. Pilato,Learning syntax by automata induction, Machine learning, Vol. 2, 1987, pp. 9\u201338.","journal-title":"Machine learning"},{"key":"BF01941135_CR4","unstructured":"Horowitz and Sahni,Fundamentals of Data Structures in Pascal, Computer Science Press, 1984."},{"key":"BF01941135_CR5","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1016\/S0019-9958(78)90562-4","volume":"37","author":"E. M. Gold","year":"1978","unstructured":"E. M. Gold,Complexity of automaton identification from given data, Information and Control, Vol. 37, pp. 302\u2013320, 1978.","journal-title":"Information and Control"}],"container-title":["BIT"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01941135.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01941135\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01941135","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T16:33:57Z","timestamp":1557765237000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01941135"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,9]]},"references-count":5,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1988,9]]}},"alternative-id":["BF01941135"],"URL":"https:\/\/doi.org\/10.1007\/bf01941135","relation":{},"ISSN":["0006-3835","1572-9125"],"issn-type":[{"value":"0006-3835","type":"print"},{"value":"1572-9125","type":"electronic"}],"subject":[],"published":{"date-parts":[[1988,9]]}}}