{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:48:27Z","timestamp":1725558507963},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540201212"},{"type":"electronic","value":"9783540398578"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-39857-8_8","type":"book-chapter","created":{"date-parts":[[2010,6,28]],"date-time":"2010-06-28T04:07:15Z","timestamp":1277698035000},"page":"60-71","source":"Crossref","is-referenced-by-count":14,"title":["Unambiguous Automata Inference by Means of State-Merging Methods"],"prefix":"10.1007","author":[{"given":"Fran\u00e7ois","family":"Coste","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Fredouille","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","unstructured":"Abbadingo one (1998), http:\/\/abbadingo.cs.unm.edu\/"},{"key":"8_CR2","unstructured":"Alqu\u00e9zar, R., Sanfeliu, A.: Incremental grammatical inference from positive and negative data using unbiased finite state automata. In: Shape, Structure and Pattern Recognition, Proc. Int. Workshop on Structural and Syntactic Pattern Recognition, SSPR 1994, Nahariya (Israel), pp. 291\u2013300 (1995)"},{"key":"8_CR3","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/978-3-540-45257-7_3","volume-title":"Grammatical Inference: Algorithms and Applications","author":"F. Coste","year":"2000","unstructured":"Coste, F., Fredouille, D.: Efficient ambiguity detection in C-NFA, a step toward inference of non deterministic automata. In: Oliveira, A.L. (ed.) ICGI 2000. LNCS (LNAI), vol.\u00a01891, pp. 25\u201338. Springer, Heidelberg (2000)"},{"key":"8_CR4","unstructured":"Coste, F., Fredouille, D.: What is the search space for the inference of nondeterministic, unambiguous and deterministic automata? Technical report, IRISA (2003) (to appear), download http:\/\/www.irisa.fr\/prive\/dfredoui\/down\/report.ps.gz"},{"key":"8_CR5","unstructured":"Coste, F.: State merging inference of finite state classifiers. Technical Report INRIA\/RR-3695, IRISA (September 1999)"},{"issue":"7","key":"8_CR6","doi-asserted-by":"publisher","first-page":"1895","DOI":"10.1162\/089976698300017197","volume":"10","author":"T.G. Dietterich","year":"1998","unstructured":"Dietterich, T.G.: Approximate statistical test for comparing supervised classification learning algorithms. Neural Computation\u00a010(7), 1895\u20131923 (1998)","journal-title":"Neural Computation"},{"key":"8_CR7","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/978-3-540-45257-7_4","volume-title":"Grammatical Inference: Algorithms and Applications","author":"F. Denis","year":"2000","unstructured":"Denis, F., Lemay, A., Terlutte, A.: Learning regular languages using non deterministic finite automate. In: Oliveira, A.L. (ed.) ICGI 2000. LNCS (LNAI), vol.\u00a01891, pp. 39\u201350. Springer, Heidelberg (2000)"},{"key":"8_CR8","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/3-540-45583-3_26","volume-title":"Algorithmic Learning Theory","author":"F. Denis","year":"2001","unstructured":"Denis, F., Lemay, A., Terlutte, A.: Learning regular languages using RFSA. In: Abe, N., Khardon, R., Zeugmann, T. (eds.) ALT 2001. LNCS (LNAI), vol.\u00a02225, pp. 348\u2013363. Springer, Heidelberg (2001)"},{"key":"8_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/3-540-58473-0_134","volume-title":"Grammatical Inference and Applications","author":"P. Dupont","year":"1994","unstructured":"Dupont, P., Miclet, L., Vidal, E.: What is the search space of the regular inference? In: Carrasco, R.C., Oncina, J. (eds.) ICGI 1994. LNCS, vol.\u00a0862, pp. 25\u201337. Springer, Heidelberg (1994)"},{"key":"8_CR10","unstructured":"Davey, B., Priesley, A.: Introduction to lattices and order. Cambridge mathematical textbooks (1990)"},{"key":"8_CR11","unstructured":"Dupont, P.: Utilisation et apprentissage de mod\u00e8les de langages pour la reconnaissance de la parole continue. PhD thesis, Ecole Nationale Sup\u00e9rieure des T\u00e9l\u00e9communications (1996)"},{"key":"8_CR12","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":"8_CR13","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1023\/A:1007353007695","volume":"27","author":"C. Higuera de la","year":"1997","unstructured":"de la Higuera, C.: Characteristic sets for polynomial grammatical inference. Machine Learning\u00a027, 125\u2013138 (1997)","journal-title":"Machine Learning"},{"key":"8_CR14","doi-asserted-by":"crossref","unstructured":"Lang, K.J.: Random dfa\u2019s can be approximately learned from sparse uniform examples. In: 5th ACM workshop on Computation Learning Theorie, pp. 45 \u2013 52 (1992)","DOI":"10.1145\/130385.130390"},{"key":"8_CR15","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0054059","volume-title":"Grammatical Inference","author":"K.J. Lang","year":"1998","unstructured":"Lang, K.J., Pearlmutter, B.A., Price, R.A.: Results of the abbadingo one DFA learning competition and a new evidence-driven state merging algorithm. In: Honavar, V.G., Slutzki, G. (eds.) ICGI 1998. LNCS (LNAI), vol.\u00a01433, pp. 1\u201312. Springer, Heidelberg (1998)"},{"key":"8_CR16","doi-asserted-by":"crossref","unstructured":"Oncina, J., Garc\u00eda, P.: Inferring regular languages in polynomial update time. Pattern Recognition and Image Analysis, 49\u201361 (1992)","DOI":"10.1142\/9789812797902_0004"},{"key":"8_CR17","doi-asserted-by":"crossref","unstructured":"Pitt, L., Warmuth, M.: The minimum consistent DFA problem cannot be approximated within any polynomial. In: 21st ACM Symposium on Theory of Computing, pp. 421\u2013444 (1989)","DOI":"10.1109\/SCT.1989.41829"}],"container-title":["Lecture Notes in Computer Science","Machine Learning: ECML 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-39857-8_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T13:37:21Z","timestamp":1559223441000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-39857-8_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540201212","9783540398578"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-39857-8_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}