{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:11:43Z","timestamp":1725664303608},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540585206"},{"type":"electronic","value":"9783540490302"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58520-6_55","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T11:33:44Z","timestamp":1330256024000},"page":"76-90","source":"Crossref","is-referenced-by-count":4,"title":["Efficient learning of regular expressions from good examples"],"prefix":"10.1007","author":[{"given":"Alvis","family":"Br\u0101zma","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K\u0101rlis","family":"\u010cer\u0101ns","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"10_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":"10_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":"10_CR3","doi-asserted-by":"crossref","first-page":"741","DOI":"10.1145\/322326.322334","volume":"29","author":"D. Angluin","year":"1982","unstructured":"D. Angluin. Inference of reversible languages, J.ACM, 29, p. 741\u2013765, 1982.","journal-title":"J.ACM"},{"key":"10_CR4","unstructured":"J. Barzdin. Some rules of inductive inference and their use for program synthesis. In Proc. of IFIP 1983, North Holland, 333\u2013338, 1983."},{"key":"10_CR5","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1007\/BFb0019359","volume":"502","author":"A. Brazma","year":"1991","unstructured":"A. Brazma. Inductive synthesis of dot expressions. Lecture Notes in Computer Science, 502, 156\u2013212, 1991.","journal-title":"Lecture Notes in Computer Science"},{"key":"10_CR6","first-page":"236","volume-title":"Learning a subclass of regular expressions by recognizing periodic repetitions","author":"A. Brazma","year":"1993","unstructured":"A. Brazma. Learning a subclass of regular expressions by recognizing periodic repetitions. Proceedings of the Fourth Scandinavian Conference on AI, IOS Press, the Netherlands, 1993, p. 236\u2013242."},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"A. Brazma. Efficient identification of regular expressions from representative examples. In Proceedings of Sixth Annual Workshop on Computational Learning Theory COLT'93, ACM press, 1993, p.236\u2013242.","DOI":"10.1145\/168304.168340"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"A. Brazma, K. Cerans. Efficient Learning of Regular Expressions from Good Examples. Technical report, LU-IMCS-TR-CS-94-1, Riga, 1994.","DOI":"10.1007\/3-540-58520-6_55"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"R.L. Constable. The role of fiinite automata in the development of modern computing theory. In Proc of The Kleene Symposium, North-Holland, 61\u201383, 1980.","DOI":"10.1016\/S0049-237X(08)71253-9"},{"key":"10_CR10","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":"10_CR11","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":"10_CR12","unstructured":"M. Kearns, L. Valiant. Cryptographic limitations on learning Boolean formulae and finite automata. In Proceedings of the 1988 Workshop on Computational Learning Theory, Morgan Kaufman, 359\u2013370, 1988."},{"key":"10_CR13","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":"10_CR14","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1307\/mmj\/1028998766","volume":"9","author":"R.C. Lyndon","year":"1962","unstructured":"R.C. Lyndon, M.P. Schutzenberger. The equation a M=bNcP in a free group, Michigan Math. J. 9, 289\u2013298, 1962.","journal-title":"Michigan Math. J."},{"key":"10_CR15","unstructured":"S. Muggleton. Inductive Acquisition of Expert Knowledge, Turings Institute Press, 1990."},{"key":"10_CR16","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":"10_CR17","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."},{"issue":"11","key":"10_CR18","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":"10_CR19","doi-asserted-by":"crossref","unstructured":"R. Wiehagen. From inductive inference to algorithmic learning. Proc. Third Work-shop 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","Algorithmic Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58520-6_55.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:22:53Z","timestamp":1605630173000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58520-6_55"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540585206","9783540490302"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-58520-6_55","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}