{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T09:49:07Z","timestamp":1725702547692},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642340253"},{"type":"electronic","value":"9783642340260"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-34026-0_36","type":"book-chapter","created":{"date-parts":[[2012,9,26]],"date-time":"2012-09-26T01:07:20Z","timestamp":1348621640000},"page":"488-504","source":"Crossref","is-referenced-by-count":4,"title":["An Incremental Learning Algorithm for Extended Mealy Automata"],"prefix":"10.1007","author":[{"given":"Karl","family":"Meinke","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fei","family":"Niu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"36_CR1","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1016\/S0019-9958(81)90090-5","volume":"51","author":"D. Angluin","year":"1981","unstructured":"Angluin, D.: A note on the number of queries needed to identify regular languages. Information and Control\u00a051(1), 76\u201387 (1981)","journal-title":"Information and Control"},{"issue":"1","key":"36_CR2","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0890-5401(87)90052-6","volume":"75","author":"D. Angluin","year":"1987","unstructured":"Angluin, D.: Learning regular sets from queries and counterexamples. Information and Computation\u00a075(1), 87\u2013106 (1987)","journal-title":"Information and Computation"},{"key":"36_CR3","doi-asserted-by":"crossref","unstructured":"Balcazar, J.L., Diaz, J., Gavalda, R.: Algorithms for learning finite automata from queries. In: Advances in Algorithms, Languages and Complexity, pp. 53\u201372. Kluwer (1997)","DOI":"10.1007\/978-1-4613-3394-4_2"},{"key":"36_CR4","doi-asserted-by":"crossref","unstructured":"de la Higuera, C.: Grammatical Inference. Cambridge University Press (2010)","DOI":"10.1017\/CBO9781139194655"},{"key":"36_CR5","doi-asserted-by":"crossref","unstructured":"Dershowitz, N., Jouannaud, J.-P.: Rewrite systems. In: Handbook of Theoretical Computer Science. North-Holland (1990)","DOI":"10.1016\/B978-0-444-88074-1.50011-1"},{"key":"36_CR6","doi-asserted-by":"crossref","unstructured":"Dupont, P.: Incremental Regular Inference. In: Miclet, L., de la Higuera, C. (eds.) ICGI 1996. LNCS (LNAI), vol.\u00a01147, pp. 222\u2013237. Springer, Heidelberg (1996)","DOI":"10.1007\/BFb0033357"},{"issue":"5","key":"36_CR7","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/S0019-9958(67)91165-5","volume":"10","author":"E.M. Gold","year":"1967","unstructured":"Gold, E.M.: Language identification in the limit. Information and Control\u00a010(5), 447\u2013474 (1967)","journal-title":"Information and Control"},{"key":"36_CR8","unstructured":"Goguen, J.A., Meseguer, J.: Initiality, induction and computability. In: Algebraic Methods in Semantics, pp. 460\u2013541. Cambridge University Press (1985)"},{"key":"36_CR9","unstructured":"Klop, J.W.: Term rewriting systems. In: Handbook of Logic in Computer Science, vol.\u00a02, pp. 2\u2013117. Oxford University Press (1992)"},{"key":"36_CR10","doi-asserted-by":"crossref","unstructured":"Knuth, D.E., Bendix, P.: Simple word problems in universal algebras. In: Computational Problems in Abstract Algebra, pp. 263\u2013269. Pergamon Press (1970)","DOI":"10.1016\/B978-0-08-012975-4.50028-X"},{"key":"36_CR11","doi-asserted-by":"crossref","unstructured":"Lang, K.J.: Random dfa\u2019s can be approximately learned from sparse uniform examples. In: Fifth ACM Workshop on Computational Learning Theory, pp. 45\u201352. ACM Press (1992)","DOI":"10.1145\/130385.130390"},{"key":"36_CR12","unstructured":"Lloyd, J.W.: Foundations of Logic Programming. Springer (1993)"},{"key":"36_CR13","series-title":"LNCS (LNAI)","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/978-3-642-15488-1_13","volume-title":"Grammatical Inference: Theoretical Results and Applications","author":"K. Meinke","year":"2010","unstructured":"Meinke, K.: CGE: A Sequential Learning Algorithm for Mealy Automata. In: Sempere, J.M., Garc\u00eda, P. (eds.) ICGI 2010. LNCS (LNAI), vol.\u00a06339, pp. 148\u2013162. Springer, Heidelberg (2010)"},{"key":"36_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-3-642-24580-0_8","volume-title":"Testing Software and Systems","author":"K. Meinke","year":"2011","unstructured":"Meinke, K., Niu, F.: Learning-Based Testing for Reactive Systems Using Term Rewriting Technology. In: Wolff, B., Za\u00efdi, F. (eds.) ICTSS 2011. LNCS, vol.\u00a07019, pp. 97\u2013114. Springer, Heidelberg (2011)"},{"key":"36_CR15","doi-asserted-by":"crossref","unstructured":"Meinke, K., Niu, F., Sindhu, M.: Learning-based software testing: a tutorial. In: Proc. Int. ISoLA Workshop on Machine Learning for Software Construction. CCIS. Springer (2012)","DOI":"10.1007\/978-3-642-34781-8_16"},{"key":"36_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/978-3-642-21768-5_11","volume-title":"Tests and Proofs","author":"K. Meinke","year":"2011","unstructured":"Meinke, K., Sindhu, M.A.: Incremental Learning-Based Testing for Reactive Systems. In: Gogolla, M., Wolff, B. (eds.) TAP 2011. LNCS, vol.\u00a06706, pp. 134\u2013151. Springer, Heidelberg (2011)"},{"key":"36_CR17","doi-asserted-by":"crossref","unstructured":"Meinke, K., Tucker, J.V.: Universal algebra. In: Handbook of Logic in Computer Science, vol.\u00a01, pp. 189\u2013411. Oxford University Press (1993)","DOI":"10.1093\/oso\/9780198537359.003.0003"},{"key":"36_CR18","doi-asserted-by":"crossref","unstructured":"Oncina, J., Garcia, P.: Inferring regular languages in polynomial update time. In: Pattern Recognition and Image Analysis. Series in Machine Perception and Artificial Intelligence. World Scientific (1992)","DOI":"10.1142\/9789812797902_0004"},{"key":"36_CR19","unstructured":"Parekh, R., Honavar, V.: Grammar inference, automata induction and language acquisition. In: Handbook of Natural Language Processing, Marcel Dekker (2000)"},{"key":"36_CR20","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/BFb0054062","volume-title":"Grammatical Inference","author":"R.G. Parekh","year":"1998","unstructured":"Parekh, R.G., Nichitiu, C., Honavar, V.G.: A Polynomial Time Incremental Algorithm for Learning DFA. In: Honavar, V.G., Slutzki, G. (eds.) ICGI 1998. LNCS (LNAI), vol.\u00a01433, pp. 37\u201349. Springer, Heidelberg (1998)"}],"container-title":["Lecture Notes in Computer Science","Leveraging Applications of Formal Methods, Verification and Validation. Technologies for Mastering Change"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-34026-0_36.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,29]],"date-time":"2024-04-29T20:15:32Z","timestamp":1714421732000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-34026-0_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642340253","9783642340260"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-34026-0_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}