{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T18:53:36Z","timestamp":1794336816900,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540644170","type":"print"},{"value":"9783540697817","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0026669","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T03:27:35Z","timestamp":1132370855000},"page":"37-42","source":"Crossref","is-referenced-by-count":0,"title":["Inference of finite automata: Reducing the search space with an ordering of pairs of states"],"prefix":"10.1007","author":[{"given":"Fran\u00e7ois","family":"Coste","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jacques","family":"Nicolas","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,6,16]]},"reference":[{"key":"5_CR1","unstructured":"Coste, F. and Nicolas, J.: Regular Inference as a Graph Coloring Problem. Workshop on Grammar Inference, Automata Induction, and Language Acquisition (ICML' 97), Nashville, TN."},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Dupont, P.; Miclet, L.; and E.Vidal. What is the search space of the regular inference ? ICGI'94, Grammatical inference and Applications 25\u201337. Springer Verlag.","DOI":"10.1007\/3-540-58473-0_134"},{"key":"5_CR3","unstructured":"Dupont, P. Utilisation et apprentissage de mod\u00e8les de langages pour la reconnaissance de la parole continue. Ph.D. Dissertation, Ecole Nationale Sup\u00e9rieure des T\u00e9l\u00e9communications"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Lang, K. Random DFA's can be Approximately Learned from Sparse Uniform Examples. In proceedings of the fifth annual ACM Workshop on Computational Learning Theory 45\u201352, July 1992.","DOI":"10.1145\/130385.130390"},{"key":"5_CR5","unstructured":"Lang, K. Merge Order count NECI Tech Report, Sept26, 1997"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Oncina, J., and Garcia, P. Inferring regular languages in polynomial update time. Pattern Recognition and Image Analysis 49\u201361.","DOI":"10.1142\/9789812797902_0004"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Quinlan, J.R. Induction of decision trees. Machine Learning (1):81\u2013106.","DOI":"10.1007\/BF00116251"},{"key":"5_CR8","unstructured":"Trakhenbrot, B. and Barzdin, Y., Finite Automata: Behavior and Synthesis Amsterdam, North Holland Pub. Comp"}],"container-title":["Lecture Notes in Computer Science","Machine Learning: ECML-98"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0026669","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,10]],"date-time":"2020-04-10T21:41:12Z","timestamp":1586554872000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0026669"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540644170","9783540697817"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/bfb0026669","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/bfb0026664","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998]]}}}