{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:10:30Z","timestamp":1725491430150},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540372134"},{"type":"electronic","value":"9783540372141"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11812128_25","type":"book-chapter","created":{"date-parts":[[2006,8,9]],"date-time":"2006-08-09T05:32:31Z","timestamp":1155101551000},"page":"265-274","source":"Crossref","is-referenced-by-count":11,"title":["A Family of Algorithms for Non Deterministic Regular Languages Inference"],"prefix":"10.1007","author":[{"given":"Manuel V\u00e1zquez","family":"de Parga","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pedro","family":"Garc\u00eda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jos\u00e9","family":"Ruiz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"25_CR1","first-page":"166","volume":"47","author":"A. Arnold","year":"1970","unstructured":"Arnold, A., Dicky, A., Nivat, M.: A note about minimal non-deterministic automata. Bull. EATCS\u00a047, 166\u2013169 (1970)","journal-title":"Bull. EATCS"},{"key":"25_CR2","unstructured":"Carrez, C.: On the minimalization of non-deterministic automata. Laboratoire de Calcul de la Facult\u00e9 des Sciences de L\u2019Universit\u00e9 de Lille (1970)"},{"issue":"2","key":"25_CR3","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/j.tcs.2003.11.008","volume":"313","author":"F. Denis","year":"2004","unstructured":"Denis, F., Lemay, A., Terlutte, A.: Learning regular languages using RFSAs. Theoretical Computer Science\u00a0313(2), 267\u2013294 (2004)","journal-title":"Theoretical Computer Science"},{"key":"25_CR4","first-page":"181","volume":"87","author":"P. Garc\u00eda","year":"2005","unstructured":"Garc\u00eda, P., Vazquez de Parga, M.: A Note about mergible states in large NFA. Bull. of the EATCS\u00a087, 181\u2013184 (2005)","journal-title":"Bull. of the EATCS"},{"key":"25_CR5","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/S0019-9958(67)91165-5","volume":"10","author":"E.M. Gold","year":"1967","unstructured":"Gold, E.M.: Language identification in the limit. Information and Control\u00a010, 447\u2013474 (1967)","journal-title":"Information and Control"},{"key":"25_CR6","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1016\/S0019-9958(78)90562-4","volume":"37","author":"E.M. Gold","year":"1978","unstructured":"Gold, E.M.: Complexity of Automaton Identification from Given Data. Information and Control\u00a037, 302\u2013320 (1978)","journal-title":"Information and Control"},{"key":"25_CR7","unstructured":"Lombardy, S.: Approche structurelle de quelques probl\u00e9mes de la th\u00e9orie des automates. Ph.D. Thesis, Ecole N.S. des T\u00e9l\u00e9comunications (2001)"},{"key":"25_CR8","volume-title":"Pattern Recognition and Image Analysis","author":"J. Oncina","year":"1992","unstructured":"Oncina, J., Garc\u00eda, P.: Inferring Regular Languages in Polynomial Updated Time. In: de la Blanca, P., Sanfeli\u00fa, Vidal (eds.) Pattern Recognition and Image Analysis. World Scientific, Singapore (1992)"},{"key":"25_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/978-3-540-30500-2_37","volume-title":"Implementation and Application of Automata","author":"L. Pol\u00e1k","year":"2005","unstructured":"Pol\u00e1k, L.: Minimalizations of NFA using the universal automaton. In: Domaratzki, M., Okhotin, A., Salomaa, K., Yu, S. (eds.) CIAA 2004. LNCS, vol.\u00a03317, pp. 325\u2013326. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11812128_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,11]],"date-time":"2019-03-11T13:50:40Z","timestamp":1552312240000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11812128_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540372134","9783540372141"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/11812128_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}