{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:26:35Z","timestamp":1725474395085},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540452645"},{"type":"electronic","value":"9783540452652"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11872436_3","type":"book-chapter","created":{"date-parts":[[2006,11,27]],"date-time":"2006-11-27T08:21:00Z","timestamp":1164615660000},"page":"19-31","source":"Crossref","is-referenced-by-count":2,"title":["Identification in the Limit of Systematic-Noisy Languages"],"prefix":"10.1007","author":[{"given":"Fr\u00e9d\u00e9ric","family":"Tantini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Colin","family":"de la Higuera","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Christophe","family":"Janodet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/S0304-3975(97)00014-5","volume":"185","author":"Y. Sakakibara","year":"1997","unstructured":"Sakakibara, Y.: Recent Advances of Grammatical Inference. Theoretical Computer Science\u00a0185, 15\u201345 (1997)","journal-title":"Theoretical Computer Science"},{"key":"3_CR2","doi-asserted-by":"publisher","first-page":"1332","DOI":"10.1016\/j.patcog.2005.01.003","volume":"38","author":"C. Higuera de la","year":"2005","unstructured":"de la Higuera, C.: A bibliographical study of grammatical inference. Pattern Recognition\u00a038, 1332\u20131348 (2005)","journal-title":"Pattern Recognition"},{"key":"3_CR3","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":"3_CR4","doi-asserted-by":"crossref","unstructured":"de la Higuera, C.: Data complexity in Grammatical Inference. In: Data complexity in Pattern Recognition. Advanced Information and Knowledge Processing, Springer, Heidelberg (2006); ISBN: 1-84628-171-7","DOI":"10.1007\/978-1-84628-172-3_8"},{"key":"3_CR5","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/S0304-3975(00)00132-8","volume":"261","author":"J. Case","year":"2001","unstructured":"Case, J., Jain, S., Sharma, A.: Synthesizing noise-tolerant language learners. Theoretical Computer Science\u00a0261, 31\u201356 (2001)","journal-title":"Theoretical Computer Science"},{"key":"3_CR6","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/S0304-3975(97)00018-2","volume":"185","author":"F. Stephan","year":"1997","unstructured":"Stephan, F.: Noisy inference and oracles. Theoretical Computer Science\u00a0185, 129\u2013157 (1997)","journal-title":"Theoretical Computer Science"},{"key":"3_CR7","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1016\/S0019-9958(74)91369-2","volume":"26","author":"R.M. Wharton","year":"1974","unstructured":"Wharton, R.M.: Approximate language identification. Information and Control\u00a026, 236\u2013255 (1974)","journal-title":"Information and Control"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Kearns, M., Valiant, L.: Cryptographic limitations on learning boolean formulae and finite automata. In: 21st ACM Symposium on Theory of Computing, pp. 433\u2013444 (1989)","DOI":"10.1145\/73007.73049"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Kearns, M.: Efficient noise-tolerant learning from statistical queries. In: Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, pp. 392\u2013401 (1993)","DOI":"10.1145\/167088.167200"},{"key":"3_CR10","unstructured":"Sebban, M., Janodet, J.C.: On state merging in grammatical inference: a statistical approach for dealing with noisy data. In: Proceedings of ICML (2003)"},{"key":"3_CR11","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/978-3-540-39857-8_17","volume-title":"Machine Learning: ECML 2003","author":"A. Habrard","year":"2003","unstructured":"Habrard, A., Bernard, M., Sebban, M.: Improvement of the state merging rule on noisy data in probabilistic grammatical inference. In: Lavra\u010d, N., Gamberger, D., Todorovski, L., Blockeel, H. (eds.) ECML 2003. LNCS (LNAI), vol.\u00a02837, pp. 169\u2013180. Springer, Heidelberg (2003)"},{"key":"3_CR12","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/978-3-540-39857-8_8","volume-title":"Machine Learning: ECML 2003","author":"F. Coste","year":"2003","unstructured":"Coste, F., Fredouille, D.: Unambiguous automata inference by means of state-merging methods. In: Lavra\u010d, N., Gamberger, D., Todorovski, L., Blockeel, H. (eds.) ECML 2003. LNCS (LNAI), vol.\u00a02837, pp. 60\u201371. Springer, Heidelberg (2003)"},{"key":"3_CR13","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1023\/A:1010884214864","volume":"44","author":"C.L. Giles","year":"2001","unstructured":"Giles, C.L., Lawrence, S., Tsoi, A.: Noisy time series prediction using recurrent neural networks and grammatical inference. Machine Learning Journal\u00a044, 161\u2013183 (2001)","journal-title":"Machine Learning Journal"},{"key":"3_CR14","unstructured":"Yokomori, T., Kobayashi, S.: Inductive learning of regular sets from examples: a rough set approach. In: Proc. of International Workshop on Rough Sets and Soft Computing (1994)"},{"key":"3_CR15","unstructured":"Miclet, L., Bayoudh, S., Delhay, A.: D\u00e9finitions et premi\u00e8res exp\u00e9riences en apprentissage par analogie dans les s\u00e9quences. In: Denis, F. (ed.) CAP, PUG, pp. 31\u201348 (2005)"},{"key":"3_CR16","doi-asserted-by":"publisher","first-page":"1013","DOI":"10.1109\/TPAMI.2005.147","volume":"27","author":"E. Vidal","year":"2005","unstructured":"Vidal, E., Thollard, F., de la Higuera, C., Casacuberta, F., Carrasco, R.C.: Probabilistic finite state automata \u2013 part I and II. Pattern Analysis and Machine Intelligence\u00a027, 1013\u20131039 (2005)","journal-title":"Pattern Analysis and Machine Intelligence"},{"key":"3_CR17","first-page":"205","volume":"9","author":"N. Abe","year":"1992","unstructured":"Abe, N., Warmuth, M.: On the computational complexity of approximating distributions by probabilistic automata. Machine Learning Journal\u00a09, 205\u2013260 (1992)","journal-title":"Machine Learning Journal"},{"key":"3_CR18","unstructured":"Thollard, F., Clark, A.: Pac-learnability of probabilistic deterministic finite state automata. Journal of Machine Learning Research, 473\u2013497 (2004)"},{"key":"3_CR19","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/3-540-58473-0_144","volume-title":"Grammatical Inference and Applications","author":"R.C. Carrasco","year":"1994","unstructured":"Carrasco, R.C., Oncina, J.: Learning stochastic regular grammars by means of a state merging method. In: Carrasco, R.C., Oncina, J. (eds.) ICGI 1994. LNCS (LNAI), vol.\u00a0862, pp. 139\u2013150. Springer, Heidelberg (1994)"},{"key":"3_CR20","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/S0019-9958(67)91165-5","volume":"10","author":"M. Gold","year":"1967","unstructured":"Gold, M.: Language identification in the limit. Information and Control\u00a010, 447\u2013474 (1967)","journal-title":"Information and Control"},{"key":"3_CR21","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":"3_CR22","unstructured":"de la Higuera, C.: Complexity and reduction issues in grammatical inference. Technical Report, Universit\u00e4t T\u00fcbingen (2005) ISSN 0946-3852"},{"key":"3_CR23","first-page":"707","volume":"10","author":"V.I. Levenshtein","year":"1965","unstructured":"Levenshtein, V.I.: Binary codes capable of correcting deletions, insertions, and reversals. Cybernetics and Control Theory\u00a010, 707\u2013710 (1965); Original in Doklady Akademii Nauk SSSR, 163(4), 845\u2013848 (1965)","journal-title":"Cybernetics and Control Theory"},{"key":"3_CR24","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1145\/321796.321811","volume":"21","author":"R. Wagner","year":"1974","unstructured":"Wagner, R., Fisher, M.: The string-to-string correction problem. Journal of the ACM\u00a021, 168\u2013178 (1974)","journal-title":"Journal of the ACM"},{"key":"3_CR25","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/0020-0190(88)90208-6","volume":"28","author":"Y. Takada","year":"1988","unstructured":"Takada, Y.: Grammatical inference for even linear languages based on control sets. Information Processing Letters\u00a028, 193\u2013199 (1988)","journal-title":"Information Processing Letters"},{"key":"3_CR26","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/S0304-3975(97)00240-5","volume":"230","author":"C. Higuera de la","year":"2000","unstructured":"de la Higuera, C., Casacuberta, F.: Topology of strings: median string is NP-complete. Theoretical Computer Science\u00a0230, 39\u201348 (2000)","journal-title":"Theoretical Computer Science"},{"key":"3_CR27","unstructured":"Belmandt, Z.: Manuel de pr\u00e9topologie et ses applications. Herm\u00e9s (1993)"},{"key":"3_CR28","unstructured":"Pawlak, Z.: Theory of rough sets: A new methodology for knowledge discovery (abstract). In: ICCI 1990, p. 11 (1990)"},{"key":"3_CR29","doi-asserted-by":"crossref","unstructured":"Kobayashi, S., Yokomori, T.: On approximately identifying concept classes in the limit. In: ALT 1995, pp. 298\u2013312 (1995)","DOI":"10.1007\/3-540-60454-5_47"}],"container-title":["Lecture Notes in Computer Science","Grammatical Inference: Algorithms and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11872436_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,22]],"date-time":"2019-04-22T11:14:32Z","timestamp":1555931672000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11872436_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540452645","9783540452652"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/11872436_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}