{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,2]],"date-time":"2026-02-02T21:34:52Z","timestamp":1770068092849,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540880080","type":"print"},{"value":"9783540880097","type":"electronic"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-88009-7_11","type":"book-chapter","created":{"date-parts":[[2008,9,20]],"date-time":"2008-09-20T03:52:54Z","timestamp":1221882774000},"page":"139-153","source":"Crossref","is-referenced-by-count":13,"title":["State-Merging DFA Induction Algorithms with Mandatory Merge Constraints"],"prefix":"10.1007","author":[{"given":"Bernard","family":"Lambeau","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christophe","family":"Damas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre","family":"Dupont","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","series-title":"Series in Machine Perception and Artificial Intelligence","first-page":"99","volume-title":"Advances in Structural and Syntactic Pattern Recognition","author":"J. Oncina","year":"1992","unstructured":"Oncina, J., Garc\u00eda, P.: Identifying regular languages in polynomial time. In: Bunke, H. (ed.) Advances in Structural and Syntactic Pattern Recognition. Series in Machine Perception and Artificial Intelligence, vol.\u00a05, pp. 99\u2013108. World Scientific, Singapore (1992)"},{"key":"11_CR2","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0054059","volume-title":"Grammatical Inference","author":"K. Lang","year":"1998","unstructured":"Lang, K., Pearlmutter, B., Price, R.: 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)"},{"issue":"5","key":"11_CR3","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/S0019-9958(67)91165-5","volume":"10","author":"E. Gold","year":"1967","unstructured":"Gold, E.: Language identification in the limit. Information and Control\u00a010(5), 447\u2013474 (1967)","journal-title":"Information and Control"},{"key":"11_CR4","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/BFb0054076","volume-title":"Grammatical Inference","author":"F. Coste","year":"1998","unstructured":"Coste, F., Nicolas, J.: How considering incompatible state mergings may reduce the DFA induction search tree. In: Honavar, V.G., Slutzki, G. (eds.) ICGI 1998. LNCS (LNAI), vol.\u00a01433, pp. 199\u2013210. Springer, Heidelberg (1998)"},{"key":"11_CR5","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/978-3-540-30195-0_11","volume-title":"Grammatical Inference: Algorithms and Applications","author":"F. Coste","year":"2004","unstructured":"Coste, F., Fredouille, D., Kermorvant, C., de la Higuera, C.: Introducing domain and typing bias in automata inference. In: Paliouras, G., Sakakibara, Y. (eds.) ICGI 2004. LNCS (LNAI), vol.\u00a03264, pp. 115\u2013126. Springer, Heidelberg (2004)"},{"issue":"12","key":"11_CR6","doi-asserted-by":"publisher","first-page":"1056","DOI":"10.1109\/TSE.2005.138","volume":"31","author":"C. Damas","year":"2005","unstructured":"Damas, C., Lambeau, B., Dupont, P., van Lamsweerde, A.: Generating annotated behavior models from end-user scenarios. IEEE Transactions on Software Engineering\u00a031(12), 1056\u20131073 (2005)","journal-title":"IEEE Transactions on Software Engineering"},{"key":"11_CR7","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1080\/08839510701853200","volume":"22","author":"P. Dupont","year":"2008","unstructured":"Dupont, P., Lambeau, B., Damas, C., van Lamsweerde, A.: The QSM algorithm and its application to software behavior model induction. Applied Artificial Intelligence\u00a022, 77\u2013115 (2008)","journal-title":"Applied Artificial Intelligence"},{"key":"11_CR8","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":"11_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/BFb0033364","volume-title":"Grammatical Inference: Learning Syntax from Sentences","author":"J. Oncina","year":"1996","unstructured":"Oncina, J., Var\u00f3, M.A.: Using domain information during the learning of a subsequential transducer. In: Miclet, L., de la Higuera, C. (eds.) ICGI 1996. LNCS, vol.\u00a01147, pp. 301\u2013312. Springer, Heidelberg (1996)"},{"issue":"2","key":"11_CR10","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1109\/TSE.2003.1178048","volume":"29","author":"S. Uchitel","year":"2003","unstructured":"Uchitel, S., Kramer, J., Magee, J.: Synthesis of behavorial models from scenarios. IEEE Transactions on Software Engineering\u00a029(2), 99\u2013115 (2003)","journal-title":"IEEE Transactions on Software Engineering"},{"key":"11_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/BFb0033357","volume-title":"Grammatical Inference: Learning Syntax from Sentences","author":"P. Dupont","year":"1996","unstructured":"Dupont, P.: Incremental regular inference. In: Miclet, L., de la Higuera, C. (eds.) ICGI 1996. LNCS, vol.\u00a01147, pp. 222\u2013237. Springer, Heidelberg (1996)"}],"container-title":["Lecture Notes in Computer Science","Grammatical Inference: Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-88009-7_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,10]],"date-time":"2024-05-10T03:47:35Z","timestamp":1715312855000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-88009-7_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540880080","9783540880097"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-88009-7_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008]]}}}