{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T03:23:14Z","timestamp":1649128994927},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1997,3,1]],"date-time":"1997-03-01T00:00:00Z","timestamp":857174400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["New Gener Comput"],"published-print":{"date-parts":[[1997,3]]},"DOI":"10.1007\/bf03037562","type":"journal-article","created":{"date-parts":[[2009,4,24]],"date-time":"2009-04-24T03:26:24Z","timestamp":1240543584000},"page":"105-140","source":"Crossref","is-referenced-by-count":1,"title":["Noise-tolerant efficient inductive synthesis of regular expressions from good examples"],"prefix":"10.1007","volume":"15","author":[{"given":"Alvis","family":"Br\u2212azma","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K\u2212arlis","family":"\u010cer\u2212ans","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF03037562_CR1","first-page":"76","volume":"51","author":"D. Angluin","year":"1981","unstructured":"Angluin, D., \u201cA Note on the Number of Queries to Identify Regular Languages,\u201dInformation and Computation, 51, pp. 76\u201387, 1981.","journal-title":"Information and Computation"},{"issue":"2","key":"BF03037562_CR2","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0890-5401(87)90052-6","volume":"75","author":"D. Angluin","year":"1987","unstructured":"Angluin, D., \u201cLearning Regular Sets from Queries and Counterexamples,\u201dInformation and Computation, 75, 2, pp. 87\u2013106, 1987.","journal-title":"Information and Computation"},{"key":"BF03037562_CR3","doi-asserted-by":"crossref","first-page":"741","DOI":"10.1145\/322326.322334","volume":"29","author":"D. Angluin","year":"1982","unstructured":"Angluin, D., \u201cInference of Reversible Languages,\u201dJ. ACM, 29, pp. 741\u2013765, 1982.","journal-title":"J. ACM"},{"key":"BF03037562_CR4","first-page":"343","volume":"2","author":"D. Angluin","year":"1988","unstructured":"Angluin, D. and Laird, P., \u201cLearning from Noisy Examples,\u201dMachine Learning, 2, pp. 343\u2013370, 1988.","journal-title":"Machine Learning"},{"key":"BF03037562_CR5","doi-asserted-by":"crossref","unstructured":"Aho, A., \u201cPattern Matching in Strings,\u201d inFormal Language Theory (R. Book, ed.), Academic Press, 1980.","DOI":"10.1016\/B978-0-12-115350-2.50016-6"},{"key":"BF03037562_CR6","unstructured":"Barzdin, J., \u201cSome Rules of Inductive Inference and Their Use for Program Synthesis,\u201d inProc. of IFIP\u2019 83, North-Holland, pp. 333\u2013338, 1983."},{"key":"BF03037562_CR7","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1007\/BFb0019359","volume":"502","author":"A. Brazma","year":"1991","unstructured":"Brazma, A., \u201cInductive Synthesis of Dot Expressions,\u201dLecture Notes in Computer Science, 502, pp. 156\u2013212, 1991.","journal-title":"Lecture Notes in Computer Science"},{"key":"BF03037562_CR8","first-page":"236","volume-title":"Proc. of the Fourth Scandinavian Conference on AI","author":"A. Brazma","year":"1993","unstructured":"Brazma, A., \u201cLearning a Subclass of Regular Exprssions by Recognizing Periodic Repetitions,\u201d inProc. of the Fourth Scandinavian Conference on AI, IOS Press, the Netherlands, pp. 236\u2013242, 1993."},{"key":"BF03037562_CR9","doi-asserted-by":"crossref","unstructured":"Brazma, A., \u201cEfficient Identification of Regular Expressions from Representative Examples,\u201d inProc. of the Sixth Annual Workshop on Computational Learning Theory COLT\u2019 93, ACM press, pp. 236\u2013242, 1993.","DOI":"10.1145\/168304.168340"},{"key":"BF03037562_CR10","unstructured":"Brazma, A., \u201cAn Algorithm for Finding Approximate Regular Expressions in Biosequences,\u201d inopen poster section of the Third Annual Conference: Intelligent Systems for Molecular Biology, Robinson College, Cambridge, p. 5, 1995."},{"key":"BF03037562_CR11","doi-asserted-by":"crossref","unstructured":"Brazma, A. and Cerans, K., \u201cEfficient Learning of Regular Expressions from Good Examples,\u201dTechnical Report, LU-IMCS-TR-CS-94-1, Riga, 1994.","DOI":"10.1007\/3-540-58520-6_55"},{"key":"BF03037562_CR12","doi-asserted-by":"crossref","unstructured":"Constable, R. L., \u201cThe Role of Finite Automata in the Development of Modern Computing Theory,\u201d inProc. of the Kleene Symposium, North-Holland, pp. 61\u201383, 1980.","DOI":"10.1016\/S0049-237X(08)71253-9"},{"key":"BF03037562_CR13","unstructured":"Feller, W.An Introduction to Probability Theory and Its Applications, third edition, John Wiley & Sons, 1970."},{"key":"BF03037562_CR14","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0020-0190(93)90245-5","volume":"45","author":"V. A. Fischetti","year":"1993","unstructured":"Fischetti, V. A., Landau, G. M., Sellers, P. H., and Schmidt, J. P., \u201cIdentifying Periodic Occurrences of a Template with Applications to Protein Structure,\u201dProc. Letters, 45, pp. 11\u201318, 1993.","journal-title":"Proc. Letters"},{"key":"BF03037562_CR15","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1016\/S0019-9958(67)91165-5","volume":"10","author":"E. M. Gold","year":"1967","unstructured":"Gold, E. M., \u201cLanguage Identification in the Limit,\u201dInf. and Control, 10, pp. 447\u2013474, 1967.","journal-title":"Inf. and Control"},{"key":"BF03037562_CR16","first-page":"1","volume":"397","author":"R. Freivalds","year":"1989","unstructured":"Freivalds, R., Kinber, E., and Wiehagen, R., \u201cInductive Inference from Good Examples,\u201dLecture Notes in Artificial Intelligence, 397, pp. 1\u201318, 1989.","journal-title":"Lecture Notes in Artificial Intelligence"},{"key":"BF03037562_CR17","unstructured":"Kearns, M. and Valiant, L., \u201cCryptographic Limitations on Learning Boolean Formulae and Finite Automata,\u201d inProc. of the 1988 Workshop on Computational Learning Theory, Morgan Kaufman, pp. 359\u2013370, 1988."},{"key":"BF03037562_CR18","doi-asserted-by":"crossref","unstructured":"Kearns, M. and Li, M., \u201cLearning in the Presence of Malicious Errors,\u201d inProc. of the 20-th Annual Symposium on Theory of Computing, Chicago, Illinois, ACM Press, 1988.","DOI":"10.1145\/62212.62238"},{"key":"BF03037562_CR19","first-page":"232","volume":"642","author":"E. Kinber","year":"1992","unstructured":"Kinber, E., \u201cLearning a Class of Regular Expressions via Restricted Subset Queries,\u201dLecture Notes in Artificial Intelligence, 642, pp. 232\u2013243, 1992.","journal-title":"Lecture Notes in Artificial Intelligence"},{"key":"BF03037562_CR20","doi-asserted-by":"crossref","unstructured":"Konagaya, A., \u201cA Stochastic Approach to Genetic Information,\u201d inProc. of the 3-rd Workshop on Algorithmic Learning Theory ALT\u201992, JSAI, pp. 25\u201336, 1992.","DOI":"10.1007\/3-540-57369-0_25"},{"key":"BF03037562_CR21","doi-asserted-by":"crossref","unstructured":"Li, M. and Vitanyi, P. M. B., \u201cKolmogorov Complexity and Its Applications,\u201d inHandbook of Theoretical Computer Science, Volume A, Elsevier, p. 201, 1990.","DOI":"10.1016\/B978-0-444-88071-0.50009-6"},{"key":"BF03037562_CR22","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1307\/mmj\/1028998766","volume":"9","author":"R. C. Lyndon","year":"1962","unstructured":"Lyndon, R. C. and Schutzenberger, M. P., \u201cThe Equationa m =b n c p in a Free Group,\u201dMichigan Math. Journal, 9, pp. 289\u2013298, 1962.","journal-title":"Michigan Math. Journal"},{"key":"BF03037562_CR23","doi-asserted-by":"crossref","unstructured":"Miyano, S., \u201cLearning Theory Toward Genome Informatics,\u201d inProc. of the 4-th Workshop on Algorithmic Learning Theory ALT\u201993, Lecture Notes in Artificial Intelligence, Springer, pp. 19\u201336, 1993.","DOI":"10.1007\/3-540-57370-4_34"},{"key":"BF03037562_CR24","unstructured":"Muggleton, S.,Inductive Acquisition of Expert Knowledge, Turing Institute Press, 1990."},{"issue":"1","key":"BF03037562_CR25","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/BF02458834","volume":"51","author":"E. Myers","year":"1989","unstructured":"Myers, E. and Miller, W., \u201cApproximate Matching of Regular Expressions,\u201dBulletin of Mathematical Biology, 51, 1, pp. 5\u201337, 1989.","journal-title":"Bulletin of Mathematical Biology"},{"key":"BF03037562_CR26","unstructured":"Sloan, R., \u201cType of Noise in Data for Concept Learning,\u201d inProc. of 1988 Workshop on Computational Learning Theory, Morgan Kaufman, pp. 91\u201396, 1988."},{"key":"BF03037562_CR27","first-page":"18","volume":"397","author":"L. Pitt","year":"1989","unstructured":"Pitt, L., \u201cInductive Inference, DFAs, and Computational Complexity,\u201dLecture Notes in Artificial Intelligence, 397, pp. 18\u201344, 1989.","journal-title":"Lecture Notes in Artificial Intelligence"},{"key":"BF03037562_CR28","unstructured":"Tanida, N. and Yokomori T., \u201cPolynomial-Time Identification of Strictly Regular Languages in the Limit,\u201dIEICE Trans. Inf. & Syst. VE75-D, pp. 125\u2013132, 1992."},{"key":"BF03037562_CR29","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1137\/0207029","volume":"7","author":"R. A. Wagner","year":"1978","unstructured":"Wagner, R. A. and Seiferas, J. I., \u201cCorrecting Counter-Automaton-Recognizable Languages,\u201dSIAM Journal on Computing, 7, pp. 357\u2013375, 1978.","journal-title":"SIAM Journal on Computing"},{"key":"BF03037562_CR30","doi-asserted-by":"crossref","unstructured":"Wiehagen, R., \u201cFrom Inductive Inference to Algorithmic Learning,\u201d inProc. Third Workshop on Algorithmic Learning Theory, ALT\u201992, Sawado, pp. 13\u201324, 1992.","DOI":"10.1007\/3-540-57369-0_24"},{"key":"BF03037562_CR31","doi-asserted-by":"crossref","unstructured":"Yamanishi, K., \u201cA Learning Criterion for Stochastic Rules,\u201d inProc. of the 3-rd Workshop on Computational Learning Theory, NY, Morgan Kaufman, pp. 67\u201381, 1990.","DOI":"10.1016\/B978-1-55860-146-8.50008-4"}],"container-title":["New Generation Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF03037562.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF03037562\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF03037562","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T00:52:39Z","timestamp":1558572759000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF03037562"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,3]]},"references-count":31,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1997,3]]}},"alternative-id":["BF03037562"],"URL":"https:\/\/doi.org\/10.1007\/bf03037562","relation":{},"ISSN":["0288-3635","1882-7055"],"issn-type":[{"value":"0288-3635","type":"print"},{"value":"1882-7055","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997,3]]}}}