{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T12:36:39Z","timestamp":1742387799285,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540442394"},{"type":"electronic","value":"9783540457909"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45790-9_4","type":"book-chapter","created":{"date-parts":[[2007,5,16]],"date-time":"2007-05-16T02:46:02Z","timestamp":1179283562000},"page":"37-48","source":"Crossref","is-referenced-by-count":8,"title":["Beyond EDSM"],"prefix":"10.1007","author":[{"given":"Orlando","family":"Cicchello","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan C.","family":"Kremer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,9,5]]},"reference":[{"key":"4_CR1","volume-title":"Formal Languages And Their Relation to Automata","author":"J. E. Hopcroft","year":"1969","unstructured":"J. E. Hopcroft and J. D. Ullman, Formal Languages And Their Relation to Automata. Reading, Mass.: Addison-Wesley, 1969."},{"key":"4_CR2","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1016\/S0019-9958(78)90562-4","volume":"37","author":"E. Gold","year":"1978","unstructured":"E. Gold, \u201cComplexity of automaton identification from given data,\u201d Information and Control, vol. 37, pp. 302\u2013320, 1978.","journal-title":"Information and Control"},{"key":"4_CR3","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1016\/0020-0190(87)90114-1","volume":"24","author":"A. Blumer","year":"1987","unstructured":"A. Blumer, A. Ehrenfeucht, D. Haussler, and M. K. Warmuth, \u201cOccam\u2019s razor,\u201d Information Processing Letters, vol. 24, pp. 377\u2013380, 1987.","journal-title":"Information Processing Letters"},{"key":"4_CR4","volume-title":"Finite Automata","author":"B. A. Trakhtenbrot","year":"1973","unstructured":"B. A. Trakhtenbrot and Y. M. Barzdin, Finite Automata. Amsterdam: North-Holland, 1973."},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"K. J. Lang, \u201cRandom DFA\u2019s can be approximately learned from sparse uniform examples,\u201d in Proceedings of the Fifth ACM Workshop on Computational Learning Theory, (New York, N.Y.), pp. 45\u201352, ACM, 1992.","DOI":"10.1145\/130385.130390"},{"key":"4_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BFb0054059","volume":"1433","author":"K. J. Lang","year":"1998","unstructured":"K. J. Lang, B. A. Pearlmutter, and R. A. Price, \u201cResults of the Abbadingo one DFA learning competition and a new evidence-driven state merging algorithm,\u201d in Proc. 4th International Colloquium on Grammatical Inference-ICGI\u2019 98, vol. 1433, pp. 1\u201312, Springer-Verlag, 1998.","journal-title":"Proc. 4th International Colloquium on Grammatical Inference-ICGI\u2019 98"},{"key":"4_CR7","first-page":"26","volume-title":"Proceedings of the Fifteenth National Conference on Artificial Intelligence (AAAI-98) Tenth Conference on Innovative Applications of Artificial Intelligence (IAAI-98)","author":"H. Juille","year":"1998","unstructured":"H. Juille and J. B. Pollack, \u201cA sampling-based heuristic for tree search applied to grammar induction,\u201d in Proceedings of the Fifteenth National Conference on Artificial Intelligence (AAAI-98) Tenth Conference on Innovative Applications of Artificial Intelligence (IAAI-98), (Madison, Wisconsin, USA), AAAI Press Books, 26\u201330 1998."},{"key":"4_CR8","unstructured":"K. Lang, \u201cEvidence-driven state merging with search,\u201d 1998."},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"A. L. Oliveira and J. P. M. Silva, \u201cEfficient search techniques for the inference of minimum size finite automata,\u201d in String Processing and Information Retrieval, pp. 81\u201389, 1998.","DOI":"10.1109\/SPIRE.1998.712986"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"J. M. Pena and A. L. Oliveira, \u201cA new algorithm for the reduction of incompletely specified finite state machines,\u201d in Proc. of the ACM\/IEEE International Conference on Computer Aided Design, (San Jose), pp. 482\u2013489, IEEE Computer Society Press, 1998.","DOI":"10.1145\/288548.289075"}],"container-title":["Lecture Notes in Computer Science","Grammatical Inference: Algorithms and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45790-9_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T09:18:23Z","timestamp":1737019103000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45790-9_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540442394","9783540457909"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-45790-9_4","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}