{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,23]],"date-time":"2026-07-23T18:20:32Z","timestamp":1784830832182,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540591191","type":"print"},{"value":"9783540491958","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-59119-2_194","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:03:21Z","timestamp":1330275801000},"page":"392-403","source":"Crossref","is-referenced-by-count":4,"title":["Learning of regular expressions by pattern matching"],"prefix":"10.1007","author":[{"given":"Alvis","family":"Br\u0101zma","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"30_CR1","first-page":"76","volume":"51","author":"D. Angluin","year":"1981","unstructured":"D.Angluin. A note on the number of queries to identify regular languages. Information and Computation, 51:76\u201387, 1981.","journal-title":"Information and Computation"},{"issue":"2","key":"30_CR2","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0890-5401(87)90052-6","volume":"75","author":"D. Angluin","year":"1987","unstructured":"D.Angluin. Learning regular sets from queries and counterexamples. Information and Computation, 75(2):87\u2013106, 1987.","journal-title":"Information and Computation"},{"key":"30_CR3","doi-asserted-by":"crossref","unstructured":"J.Barzdin, G.Barzdin, K.Apsitis, U.Sarkans. Towards efficient inductive synthesis of expressions from input\/output examples. In Proc of th 4th Workshop on Algorithmic Learning Theory (ALT'93), Lect. Notes in Artific. Intel., Springer, 1993, 59\u201372.","DOI":"10.1007\/3-540-57370-4_37"},{"key":"30_CR4","doi-asserted-by":"crossref","unstructured":"A.Brazma. Efficient identification of regular expressions from representative examples. In Proc. of 6th Annual Workshop on Comput. Learn. Theory COLT'93, ACM Press, 1993, p.236\u2013242.","DOI":"10.1145\/168304.168340"},{"key":"30_CR5","first-page":"76","volume":"872","author":"A. Brazma","year":"1994","unstructured":"A.Brazma, K.Cerans. Efficient learning of regular expressions from good examples. In proc. of 4th Intern. Workshop on Analogical and Inductive Inference (AII'94), Lecture Notes in Artificial Intelligence, Vol 872, 1994, pp.76\u201390.","journal-title":"Lecture Notes in Artificial Intelligence"},{"key":"30_CR6","doi-asserted-by":"crossref","unstructured":"A.Brazma. Efficient algorithms for learning simple regular expressions from noisy examples. In proc. of 5th International Workshop on Algorithmic Learning Theory (ALT'94), Lecture Notes in Artificial Intelligence, Vol 872, pp.260\u2013271.","DOI":"10.1007\/3-540-58520-6_69"},{"key":"30_CR7","first-page":"1","volume":"397","author":"R. Freivalds","year":"1989","unstructured":"R.Freivalds, E.Kinber, R.Wiehagen. Inductive inference from good examples. Lecture Notes in Artificial Intelligence, 397, 1\u201318, 1989.","journal-title":"Lecture Notes in Artificial Intelligence"},{"key":"30_CR8","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1016\/S0019-9958(67)91165-5","volume":"10","author":"E.M. Gold","year":"1967","unstructured":"E.M.Gold. Language identification in the limit. Inform. contr., 10:447\u2013474, 1967.","journal-title":"Inform. contr."},{"key":"30_CR9","first-page":"232","volume":"642","author":"E. Kinber","year":"1992","unstructured":"E.Kinber. Learning a class of regular expressions via restricted subset queries, Lecture Notes in Artificial Intelligence, 642, 232\u2013243, 1992.","journal-title":"Lecture Notes in Artificial Intelligence"},{"key":"30_CR10","unstructured":"S.Muggleton. Inductive Acquisition of Expert Knowledge, Turings Institute Press, 1990."},{"key":"30_CR11","doi-asserted-by":"crossref","unstructured":"L.Pitt. Inductive Inference, DFAs, and Computational Complexity. Lecture Notes in Artificial Intelligence, 397:18\u201344, Springer-Verlag, 1989","DOI":"10.1007\/3-540-51734-0_50"},{"key":"30_CR12","first-page":"125","volume":"V E75-D","author":"N. Tanida","year":"1992","unstructured":"N.Tanida, T.Yokomori. Polynomial-time identification of strictly regular languages in the limit. IEICE Trans. Inf. & Syst., V E75-D, 1992, 125\u2013132.","journal-title":"IEICE Trans. Inf. & Syst."},{"issue":"11","key":"30_CR13","first-page":"1134","volume":"27","author":"L.G. Valiant","year":"1984","unstructured":"L.G.Valiant. A theory of the learnable. Comm. Assoc. Comp. Mach., 27(11):1134\u20131142, 1984.","journal-title":"Comm. Assoc. Comp. Mach."},{"key":"30_CR14","doi-asserted-by":"crossref","unstructured":"R.Wiehagen. From inductive inference to algorithmic learning. Proc. Third Workshop on Algorithmic Learning Theory, ALT'92, Sawado, 1992, 13\u201324.","DOI":"10.1007\/3-540-57369-0_24"}],"container-title":["Lecture Notes in Computer Science","Computational Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-59119-2_194.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:25:38Z","timestamp":1605648338000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-59119-2_194"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540591191","9783540491958"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-59119-2_194","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995]]}}}